AtCoder Beginner Contest 012

Submission #1590750

Source codeソースコード

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <list>
#include <string>
#include <map>
#include <numeric>
#include <queue>
#include <stack>

using namespace std;
using ll = long long;

int main() {

	/*/
	cin >> A >> B;
	for (int i = 0; i < A; i++)cin >> a[i];
	for (int i = 0; i < B; i++)cin >> b[i];

	memset(dp, -1, sizeof(dp));

	dp[0][0] = 0;

	cout << rec(0, 0) << endl;


	for (int i = 0; i < A; i++) {
		for (int j = 0; j < B; j++) {
			cout << dp[i][j] << ' ';
		}
		cout << endl;
	}

	:*/
	int dist[310][310];
	int mindist = 1010;
	int n, m;
	cin >> n >> m;

	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dist[i][j] = 1010;
		}
	}

	for (int i = 0; i < m; i++) {
		int a, b, t;
		cin >> a >> b >> t;
		a--; b--;
		dist[a][b] = dist[b][a] = t;
	}

	for (int k = 0; k < n; k++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < n; j++) {
				dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
			}
		}
	}

	for (int i = 0; i < n; i++) {
		int a = 0;
		for (int j = 0; j < n; j++) {
			a = max(a, dist[i][j]);
		}
		mindist = min(mindist, a);
	}

	cout << mindist << endl;

	return 0;
}

Submission

Task問題 D - バスと避けられない運命
User nameユーザ名 TAKEKATSU
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 1236 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
All 0 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01.txt WA
sample_02.txt AC 1 ms 256 KB
sample_03.txt WA
test_01.txt WA
test_02.txt WA
test_03.txt AC 64 ms 640 KB
test_04.txt AC 13 ms 512 KB
test_05.txt AC 24 ms 512 KB
test_06.txt AC 4 ms 384 KB
test_07.txt AC 49 ms 640 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 18 ms 512 KB
test_10.txt AC 4 ms 384 KB
test_11.txt AC 4 ms 384 KB
test_12.txt AC 20 ms 512 KB
test_13.txt AC 4 ms 384 KB
test_14.txt AC 6 ms 384 KB
test_15.txt AC 46 ms 512 KB
test_16.txt AC 6 ms 384 KB
test_17.txt AC 20 ms 512 KB
test_18.txt AC 18 ms 512 KB
test_19.txt AC 7 ms 384 KB
test_20.txt AC 6 ms 384 KB
test_21.txt AC 1 ms 256 KB
test_22.txt AC 9 ms 384 KB
test_23.txt AC 1 ms 256 KB
test_24.txt WA
test_25.txt WA
test_26.txt WA
test_27.txt WA
test_28.txt WA
test_29.txt WA
test_30.txt WA
test_31.txt WA
test_32.txt WA
test_33.txt WA
test_34.txt WA
test_35.txt WA
test_36.txt WA