Submission #662051


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <queue>

#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<29
#define ALEN(ARR) (sizeof(ARR) / sizeof((ARR)[0]))
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DDEBUG(x,y) cout<<#x<<": "<<x<<", "<<#y<<": "<<y<<endl
#define ll long long
#define ull unsigned long long
#define MOD 1000000007

typedef vector<vector<int> > Metrics;
Metrics d;

void warshall_floyd(int n) { // n:頂点数
	REP(i, n) {	// 経由する頂点
		REP(j, n) {	// 開始頂点
			REP(k, n) {	// 終端
				d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
			}
		}
	}
}


int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.precision(16);

	int n;
	cin >> n;

	d = Metrics(n, vector<int>(n, INF));
	REP(i, n) d[i][i] = 0;

	int m;
    cin >> m;
	REP(i, m) {
		int from, to, cost;
		cin >> from >> to >> cost;
		from--; to--;
		d[from][to] = cost;
		d[to][from] = cost; // if undirected graph
    }

    warshall_floyd(n);

	int res = INF;
	REP(i, n) {
		int maxcost = 0;
		REP(j, n) {
			maxcost = max(maxcost, d[i][j]);
		}
		res = min(res, maxcost);
	}

	// cout << "** RESULT **" << endl; // debug
	cout << res << endl;
	
	return 0;
}

Submission Info

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

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 28 ms 804 KB
sample_02.txt AC 25 ms 804 KB
sample_03.txt AC 27 ms 928 KB
test_01.txt AC 27 ms 800 KB
test_02.txt AC 88 ms 1568 KB
test_03.txt AC 105 ms 1440 KB
test_04.txt AC 46 ms 1056 KB
test_05.txt AC 52 ms 1180 KB
test_06.txt AC 30 ms 800 KB
test_07.txt AC 83 ms 1320 KB
test_08.txt AC 27 ms 812 KB
test_09.txt AC 42 ms 1068 KB
test_10.txt AC 28 ms 912 KB
test_11.txt AC 30 ms 800 KB
test_12.txt AC 59 ms 1184 KB
test_13.txt AC 30 ms 796 KB
test_14.txt AC 30 ms 924 KB
test_15.txt AC 81 ms 1316 KB
test_16.txt AC 31 ms 920 KB
test_17.txt AC 47 ms 1180 KB
test_18.txt AC 55 ms 1184 KB
test_19.txt AC 31 ms 928 KB
test_20.txt AC 32 ms 800 KB
test_21.txt AC 25 ms 804 KB
test_22.txt AC 36 ms 1052 KB
test_23.txt AC 27 ms 928 KB
test_24.txt AC 89 ms 1444 KB
test_25.txt AC 89 ms 1560 KB
test_26.txt AC 38 ms 1060 KB
test_27.txt AC 46 ms 1120 KB
test_28.txt AC 89 ms 1448 KB
test_29.txt AC 88 ms 1444 KB
test_30.txt AC 30 ms 808 KB
test_31.txt AC 27 ms 804 KB
test_32.txt AC 88 ms 1568 KB
test_33.txt AC 88 ms 1440 KB
test_34.txt AC 28 ms 800 KB
test_35.txt AC 37 ms 928 KB
test_36.txt AC 86 ms 1572 KB