Submission #1801324
Source Code Expand
#include<bits/stdc++.h> #define vi vector<int> #define vvi vector<vector<int> > #define vl vector<ll> #define vvl vector<vector<ll>> #define vb vector<bool> #define vc vector<char> #define vs vector<string> using ll = long long; using ld =long double; //#define int ll #define INF 1e9 #define EPS 0.0000000001 #define rep(i,n) for(int i=0;i<n;i++) #define loop(i,s,n) for(int i=s;i<n;i++) #define all(in) in.begin(), in.end() template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; } template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; } #define MAX 9999999 using namespace std; typedef pair<int, int> pii; typedef pair<int,pii> piii; #define mp make_pair signed main(){ int n,m; cin>>n>>m; int dp[301][301]; rep(i,301)rep(j,301)dp[i][j]=INF; rep(i,301)dp[i][i]=0; rep(_,m){ int to,from,cost; cin>>to>>from>>cost; --to,--from; dp[to][from]=dp[from][to]=cost; } rep(k,n)rep(i,n)rep(j,n)cmin(dp[i][j],dp[i][k]+dp[k][j]); int as=INF; rep(i,n){ int temp=0; rep(j,n){ if(i==j)continue; cmax(temp,dp[i][j]); } cmin(as,temp); } cout<<as<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - バスと避けられない運命 |
User | yebityon |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1262 Byte |
Status | AC |
Exec Time | 66 ms |
Memory | 640 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 | 640 KB |
sample_02.txt | AC | 1 ms | 640 KB |
sample_03.txt | AC | 1 ms | 640 KB |
test_01.txt | AC | 1 ms | 640 KB |
test_02.txt | AC | 24 ms | 640 KB |
test_03.txt | AC | 66 ms | 640 KB |
test_04.txt | AC | 13 ms | 640 KB |
test_05.txt | AC | 27 ms | 640 KB |
test_06.txt | AC | 5 ms | 640 KB |
test_07.txt | AC | 52 ms | 640 KB |
test_08.txt | AC | 2 ms | 640 KB |
test_09.txt | AC | 19 ms | 640 KB |
test_10.txt | AC | 4 ms | 640 KB |
test_11.txt | AC | 5 ms | 640 KB |
test_12.txt | AC | 21 ms | 640 KB |
test_13.txt | AC | 5 ms | 640 KB |
test_14.txt | AC | 7 ms | 640 KB |
test_15.txt | AC | 48 ms | 640 KB |
test_16.txt | AC | 7 ms | 640 KB |
test_17.txt | AC | 21 ms | 640 KB |
test_18.txt | AC | 20 ms | 640 KB |
test_19.txt | AC | 8 ms | 640 KB |
test_20.txt | AC | 7 ms | 640 KB |
test_21.txt | AC | 1 ms | 640 KB |
test_22.txt | AC | 10 ms | 640 KB |
test_23.txt | AC | 2 ms | 640 KB |
test_24.txt | AC | 24 ms | 640 KB |
test_25.txt | AC | 24 ms | 640 KB |
test_26.txt | AC | 7 ms | 640 KB |
test_27.txt | AC | 8 ms | 640 KB |
test_28.txt | AC | 24 ms | 640 KB |
test_29.txt | AC | 24 ms | 640 KB |
test_30.txt | AC | 3 ms | 640 KB |
test_31.txt | AC | 2 ms | 640 KB |
test_32.txt | AC | 24 ms | 640 KB |
test_33.txt | AC | 24 ms | 640 KB |
test_34.txt | AC | 2 ms | 640 KB |
test_35.txt | AC | 6 ms | 640 KB |
test_36.txt | AC | 24 ms | 640 KB |