Submission #202473
Source Code Expand
#include<iostream> #include<iomanip> #include<cstdio> #include<vector> #include<algorithm> #include<functional> #include<string> #include<cstdlib> #include<cmath> #include<map> #include<set> #include<list> #include<utility> #include<cstring> #include<queue> #include<stack> #include<climits> using namespace std; #define rrepp(i, from, to) for (int i = (from); i <= (to); ++i) #define rrep(i, from, to) for (int i = (from); i < (to); ++i) #define repp(i, from, to) for (i = (from); i <= (to); ++i) #define rep(i, from, to) for (i = (from); i < (to); ++i) int main() { int n, m; scanf("%d%d", &n, &m); vector<vector<long long> > dist(n + 1); for (int i = 1; i <= n; ++i) { dist[i].resize(n + 1, 100000000); dist[i][i] = 0; } for (int i = 0; i < m; ++i) { int a, b, t; scanf("%d%d%d", &a, &b, &t); dist[a][b] = t; dist[b][a] = t; } for (int k = 1; k <= n; ++k) { for (int i = 1; i <= n; ++i) { for (int j = 1; j <= n; ++j) { dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } } } long long result = 1000000000; for (int i = 1; i <= n; ++i) { long long maxd = -1; for (int j = 1; j <= n; ++j) { maxd = max(maxd, dist[i][j]); } result = min(result, maxd); } cout << result << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - バスと避けられない運命 |
User | yasuand |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1456 Byte |
Status | AC |
Exec Time | 102 ms |
Memory | 1692 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] ./Main.cpp:37:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 25 ms | 928 KB |
sample_02.txt | AC | 27 ms | 868 KB |
sample_03.txt | AC | 23 ms | 920 KB |
test_01.txt | AC | 24 ms | 868 KB |
test_02.txt | AC | 87 ms | 1520 KB |
test_03.txt | AC | 102 ms | 1596 KB |
test_04.txt | AC | 44 ms | 1312 KB |
test_05.txt | AC | 49 ms | 1084 KB |
test_06.txt | AC | 25 ms | 1052 KB |
test_07.txt | AC | 82 ms | 1468 KB |
test_08.txt | AC | 24 ms | 924 KB |
test_09.txt | AC | 41 ms | 1180 KB |
test_10.txt | AC | 27 ms | 956 KB |
test_11.txt | AC | 27 ms | 880 KB |
test_12.txt | AC | 58 ms | 1340 KB |
test_13.txt | AC | 27 ms | 948 KB |
test_14.txt | AC | 30 ms | 948 KB |
test_15.txt | AC | 76 ms | 1428 KB |
test_16.txt | AC | 29 ms | 1052 KB |
test_17.txt | AC | 46 ms | 1080 KB |
test_18.txt | AC | 55 ms | 1244 KB |
test_19.txt | AC | 30 ms | 1056 KB |
test_20.txt | AC | 31 ms | 952 KB |
test_21.txt | AC | 24 ms | 928 KB |
test_22.txt | AC | 34 ms | 1176 KB |
test_23.txt | AC | 51 ms | 920 KB |
test_24.txt | AC | 85 ms | 1596 KB |
test_25.txt | AC | 83 ms | 1592 KB |
test_26.txt | AC | 36 ms | 1168 KB |
test_27.txt | AC | 43 ms | 1292 KB |
test_28.txt | AC | 86 ms | 1592 KB |
test_29.txt | AC | 85 ms | 1692 KB |
test_30.txt | AC | 27 ms | 952 KB |
test_31.txt | AC | 34 ms | 928 KB |
test_32.txt | AC | 85 ms | 1592 KB |
test_33.txt | AC | 88 ms | 1508 KB |
test_34.txt | AC | 25 ms | 932 KB |
test_35.txt | AC | 33 ms | 1184 KB |
test_36.txt | AC | 83 ms | 1596 KB |