Submission #325923


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;

const long INF=1000000;

int main(){
	int n, time[300][300];
	long m;
	long ans=INF;
	
	//初期化
	for(int i=0; i<300; ++i)
	for(int j=0; j<300; ++j)
	time[i][j]=-1;
	
	//入力
	scanf(" %d %ld", &n, &m);
	for(long i=0; i<m; ++i){
		int a, b, t;
		scanf(" %d %d %d", &a, &b, &t);
		time[a-1][b-1]=time[b-1][a-1]=t;
	}	
	
	//すべての駅を順に根にしてそれぞれに対しbfsで時間を求める
	for(int i=0; i<n; ++i){
		
		long a[300]; //駅iからかかる最短時間
		a[i]=0;
		for(int j=0; j<i; ++j) a[j]=INF; //未訪問
		for(int j=i+1; j<n; ++j) a[j]=INF; //未訪問
		
		//bfs
		queue<int> que;
		que.push(i);
		while(!que.empty()){
			int v=que.front();
			que.pop();
			
			for(int j=0; j<n; ++j){
				if(time[v][j]!=-1 && a[v]+time[v][j] < a[j]){
					que.push(j);
					a[j]=a[v]+time[v][j];	
				}
			}
			
		}
		
		sort(a, a+n, greater<long>());
		if(a[0]<ans) ans=a[0];
		
		//printf("station %d: %ld\n", i+1, a[0]);
	}
	
	printf("%ld\n", ans);
	return 0;
}

Submission Info

Submission Time
Task D - バスと避けられない運命
User imulan
Language C++ (G++ 4.6.4)
Score 100
Code Size 1144 Byte
Status AC
Exec Time 623 ms
Memory 1184 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:23:33: 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
AC × 36
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 26 ms 1176 KB
sample_02.txt AC 25 ms 1172 KB
sample_03.txt AC 26 ms 1112 KB
test_01.txt AC 24 ms 1184 KB
test_02.txt AC 74 ms 1180 KB
test_03.txt AC 623 ms 1136 KB
test_04.txt AC 181 ms 1132 KB
test_05.txt AC 184 ms 1128 KB
test_06.txt AC 37 ms 1184 KB
test_07.txt AC 458 ms 1180 KB
test_08.txt AC 26 ms 1180 KB
test_09.txt AC 133 ms 1180 KB
test_10.txt AC 36 ms 1132 KB
test_11.txt AC 37 ms 1180 KB
test_12.txt AC 451 ms 1128 KB
test_13.txt AC 40 ms 1180 KB
test_14.txt AC 47 ms 1180 KB
test_15.txt AC 409 ms 1180 KB
test_16.txt AC 52 ms 1184 KB
test_17.txt AC 145 ms 1180 KB
test_18.txt AC 416 ms 1140 KB
test_19.txt AC 51 ms 1172 KB
test_20.txt AC 52 ms 1180 KB
test_21.txt AC 24 ms 1176 KB
test_22.txt AC 193 ms 1180 KB
test_23.txt AC 25 ms 1176 KB
test_24.txt AC 73 ms 1176 KB
test_25.txt AC 76 ms 1180 KB
test_26.txt AC 38 ms 1180 KB
test_27.txt AC 41 ms 1184 KB
test_28.txt AC 74 ms 1180 KB
test_29.txt AC 76 ms 1180 KB
test_30.txt AC 28 ms 1184 KB
test_31.txt AC 25 ms 1176 KB
test_32.txt AC 75 ms 1180 KB
test_33.txt AC 76 ms 1180 KB
test_34.txt AC 25 ms 1136 KB
test_35.txt AC 35 ms 1136 KB
test_36.txt AC 73 ms 1172 KB