Submission #1603501
Source Code Expand
#include<iostream> #include "string" using namespace std; int N,M,P,a[44851],b[44851],t[44851],T[301][301],mindist[301][301],mini,minipo,maxdist[301],ans,dist[301][301]; bool point[301][301],link[301][301]; int abs(int x){ if(x<0){ return -x; } return x; } int min(int x,int y){ if(x<y)return x; return y; } int max(int x,int y){ if(x>y)return x; return y; } int main(){ cin >> N>>M; for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ dist[i][j]=1000000000; point[i][j]=false; T[i][j]=2000000000; } dist[i][i]=0; maxdist[i]=0; } for(int i=0;i<M;i++){ cin>>a[i]>>b[i]>>t[i]; dist[a[i]][b[i]]=t[i]; dist[b[i]][a[i]]=t[i]; link[a[i]][b[i]]=true; link[b[i]][a[i]]=true; } 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]); } } } for(int i=1;i<=N;i++){ for(int j=1;j<=N;j++){ maxdist[i]=max(maxdist[i],dist[i][j]); } } ans=1000000000; for(int i=1;i<=N;i++){ ans=min(maxdist[i],ans); } //int K=1; //while(K<=N){ //for(int k=0;k<N;k++){ // mini=2000000000; // for(int i=1;i<=N;i++){ // if(mini>mindist[K][i]&&point[K][i]==false){ // minipo=i; // mini=mindist[K][i]; // } // } // for(int i=1;i<=N;i++){ // if(link[minipo][i]==true){ // if(mindist[K][i]>mindist[K][minipo]+T[minipo][i]){ // mindist[K][i]=mindist[K][minipo]+T[minipo][i]; // if(maxdist[K]<mindist[K][i]){ // maxdist[K]=mindist[K][i]; // } // } // } // } // point[K][minipo]=true; // } //K++; //} //ans=2000000000; //for(int i=1;i<=N;i++){ // if(ans>maxdist[i]){ // ans=maxdist[i]; // } //} cout <<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - バスと避けられない運命 |
User | yan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1780 Byte |
Status | AC |
Exec Time | 64 ms |
Memory | 1664 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 | 31 ms | 1152 KB |
test_03.txt | AC | 64 ms | 1664 KB |
test_04.txt | AC | 13 ms | 896 KB |
test_05.txt | AC | 24 ms | 1024 KB |
test_06.txt | AC | 4 ms | 512 KB |
test_07.txt | AC | 50 ms | 1536 KB |
test_08.txt | AC | 1 ms | 384 KB |
test_09.txt | AC | 18 ms | 1024 KB |
test_10.txt | AC | 4 ms | 512 KB |
test_11.txt | AC | 4 ms | 512 KB |
test_12.txt | AC | 20 ms | 1024 KB |
test_13.txt | AC | 4 ms | 512 KB |
test_14.txt | AC | 6 ms | 640 KB |
test_15.txt | AC | 45 ms | 1408 KB |
test_16.txt | AC | 7 ms | 640 KB |
test_17.txt | AC | 20 ms | 1024 KB |
test_18.txt | AC | 19 ms | 1024 KB |
test_19.txt | AC | 7 ms | 640 KB |
test_20.txt | AC | 6 ms | 640 KB |
test_21.txt | AC | 1 ms | 256 KB |
test_22.txt | AC | 9 ms | 768 KB |
test_23.txt | AC | 1 ms | 384 KB |
test_24.txt | AC | 31 ms | 1152 KB |
test_25.txt | AC | 31 ms | 1152 KB |
test_26.txt | AC | 8 ms | 768 KB |
test_27.txt | AC | 10 ms | 896 KB |
test_28.txt | AC | 31 ms | 1152 KB |
test_29.txt | AC | 31 ms | 1152 KB |
test_30.txt | AC | 2 ms | 640 KB |
test_31.txt | AC | 1 ms | 384 KB |
test_32.txt | AC | 31 ms | 1152 KB |
test_33.txt | AC | 31 ms | 1152 KB |
test_34.txt | AC | 2 ms | 512 KB |
test_35.txt | AC | 6 ms | 768 KB |
test_36.txt | AC | 31 ms | 1152 KB |