Submission #1603440


Source Code Expand

#include<iostream>
#include "string"

using namespace std;
long long N,M,P,a[44851],b[44851],t[44851],T[301][301],mindist[301][301],mini,minipo,maxdist[301],ans;
bool point[301][301],link[301][301];
int abs(int x){
	if(x<0){
		return -x;
	}
	return x;
}
 
int main(){
	cin >> N>>M;
	for(int i=0;i<M;i++){
		cin>>a[i]>>b[i]>>t[i];
		T[a[i]][b[i]]=t[i];
		T[b[i]][a[i]]=t[i];
		link[a[i]][b[i]]=true;
		link[b[i]][a[i]]=true;
	}

	for(int i=1;i<=N;i++){
		for(int j=1;j<=N;j++){
		mindist[i][j]=2000000000;
		point[i][j]=false;
		}
		mindist[i][i]=0;
		maxdist[i]=0;
	}

	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 0
Code Size 1246 Byte
Status WA
Exec Time 101 ms
Memory 2944 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 3
WA × 36
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 WA 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt WA 53 ms 1792 KB
test_03.txt WA 101 ms 2944 KB
test_04.txt WA 20 ms 1408 KB
test_05.txt WA 36 ms 1792 KB
test_06.txt WA 6 ms 768 KB
test_07.txt WA 78 ms 2560 KB
test_08.txt WA 2 ms 384 KB
test_09.txt WA 26 ms 1536 KB
test_10.txt WA 5 ms 768 KB
test_11.txt WA 6 ms 768 KB
test_12.txt WA 31 ms 1664 KB
test_13.txt WA 6 ms 768 KB
test_14.txt WA 8 ms 896 KB
test_15.txt WA 71 ms 2432 KB
test_16.txt WA 9 ms 1024 KB
test_17.txt WA 29 ms 1664 KB
test_18.txt WA 28 ms 1536 KB
test_19.txt WA 10 ms 1024 KB
test_20.txt WA 7 ms 896 KB
test_21.txt WA 1 ms 256 KB
test_22.txt WA 12 ms 1152 KB
test_23.txt WA 1 ms 384 KB
test_24.txt WA 53 ms 1792 KB
test_25.txt WA 53 ms 1920 KB
test_26.txt WA 13 ms 1280 KB
test_27.txt WA 17 ms 1280 KB
test_28.txt WA 53 ms 1792 KB
test_29.txt WA 53 ms 1792 KB
test_30.txt WA 4 ms 768 KB
test_31.txt WA 1 ms 512 KB
test_32.txt WA 53 ms 1920 KB
test_33.txt WA 53 ms 1920 KB
test_34.txt WA 2 ms 640 KB
test_35.txt WA 11 ms 1152 KB
test_36.txt WA 53 ms 1920 KB