1c:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1f:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1d:T40b,#include using namespace std; int main() { int n, m; cin >> n >> m; const long long INF = (long long)1e15; vector> dist(n + 1, vector(n + 1, INF)); for (int i = 1; i <= n; i++) dist[i][i] = 0; for (int i = 0; i < m; i++) { int x, y; long long c; cin >> x >> y >> c; if (c < dist[x][y]) { dist[x][y] = c; dist[y][x] = c; } } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (dist[i][k] < INF && dist[k][j] < INF && dist[i][k] + dist[k][j] < dist[i][j]) dist[i][j] = dist[i][k] + dist[k][j]; int best = 1; long long bestEcc = 0; for (int j = 1; j <= n; j++) bestEcc = max(bestEcc, dist[1][j]); for (int i = 2; i <= n; i++) { long long ecc = 0; for (int j = 1; j <= n; j++) ecc = max(ecc, dist[i][j]); if (ecc < bestEcc) { bestEcc = ecc; best = i; } } cout << best << " " << bestEcc << "\n"; return 0; } 1e:T40b,#include using namespace std; int main() { int n, m; cin >> n >> m; const long long INF = (long long)1e15; vector> dist(n + 1, vector(n + 1, INF)); for (int i = 1; i <= n; i++) dist[i][i] = 0; for (int i = 0; i < m; i++) { int x, y; long long c; cin >> x >> y >> c; if (c < dist[x][y]) { dist[x][y] = c; dist[y][x] = c; } } for (int k = 1; k <= n; k++) for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) if (dist[i][k] < INF && dist[k][j] < INF && dist[i][k] + dist[k][j] < dist[i][j]) dist[i][j] = dist[i][k] + dist[k][j]; int best = 1; long long bestEcc = 0; for (int j = 1; j <= n; j++) bestEcc = max(bestEcc, dist[1][j]); for (int i = 2; i <= n; i++) { long long ecc = 0; for (int j = 1; j <= n; j++) ecc = max(ecc, dist[i][j]); if (ecc < bestEcc) { bestEcc = ecc; best = i; } } cout << best << " " << bestEcc << "\n"; return 0; }