Submission #1590584
Source Code Expand
#include <bits/stdc++.h> #define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++) #define REP(i,n) FOR(i,0,n) #define REP1(i,n) for(ll i=1;i<=(n);i++) #define MOD 1000000007 #define int long long #define all(c) (c).begin(), (c).end() #define uniq(c) c.erase(unique(all(c)), (c).end()) using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef vector<int> vec; typedef vector<vec> mat; const int INF = 1e9; const ll LLINF = LLONG_MAX / 10; int N, M; int a, b, t; int d[310][310]; signed main() { cin >> N >> M; REP(i,N) REP(j,N) { if (i == j) d[i][j] = 0; else d[i][j] = LLINF; } REP(i,M) { cin >> a >> b >> t; a--; b--; d[a][b] = t; d[b][a] = t; } REP(k,N) REP(i,N) REP(j,N) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); } int ans = LLINF; REP(i,N) { int ma = 0; REP(j,N) { ma = max(ma, d[i][j]); } ans = min(ans, ma); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - バスと避けられない運命 |
User | hiyokko3 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1054 Byte |
Status | AC |
Exec Time | 59 ms |
Memory | 1024 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | sample_01.txt, sample_02.txt, sample_03.txt, 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 32 ms | 1024 KB |
test_03.txt | AC | 59 ms | 1024 KB |
test_04.txt | AC | 13 ms | 768 KB |
test_05.txt | AC | 22 ms | 768 KB |
test_06.txt | AC | 4 ms | 512 KB |
test_07.txt | AC | 45 ms | 896 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 16 ms | 640 KB |
test_10.txt | AC | 4 ms | 384 KB |
test_11.txt | AC | 4 ms | 512 KB |
test_12.txt | AC | 20 ms | 768 KB |
test_13.txt | AC | 4 ms | 512 KB |
test_14.txt | AC | 5 ms | 512 KB |
test_15.txt | AC | 42 ms | 896 KB |
test_16.txt | AC | 6 ms | 512 KB |
test_17.txt | AC | 18 ms | 640 KB |
test_18.txt | AC | 18 ms | 768 KB |
test_19.txt | AC | 6 ms | 512 KB |
test_20.txt | AC | 5 ms | 512 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 9 ms | 640 KB |
test_23.txt | AC | 1 ms | 256 KB |
test_24.txt | AC | 32 ms | 1024 KB |
test_25.txt | AC | 32 ms | 1024 KB |
test_26.txt | AC | 8 ms | 640 KB |
test_27.txt | AC | 11 ms | 768 KB |
test_28.txt | AC | 32 ms | 1024 KB |
test_29.txt | AC | 32 ms | 1024 KB |
test_30.txt | AC | 3 ms | 512 KB |
test_31.txt | AC | 1 ms | 384 KB |
test_32.txt | AC | 32 ms | 1024 KB |
test_33.txt | AC | 32 ms | 1024 KB |
test_34.txt | AC | 2 ms | 384 KB |
test_35.txt | AC | 7 ms | 640 KB |
test_36.txt | AC | 32 ms | 1024 KB |