Submission #6889294
Source Code Expand
#include <algorithm> #include <climits> #include <iostream> #include <queue> #include <utility> #include <vector> using namespace std; int main() { int N, M, a, b, t, ans = INT_MAX; cin >> N >> M; vector<vector<pair<int, int>>> c(N); for (int i = 0; i < M; ++i) { cin >> a >> b >> t; c[a - 1].emplace_back(b - 1, t); c[b - 1].emplace_back(a - 1, t); } for (int i = 0; i < N; ++i) { queue<int> d; d.push(i); vector<int> e(N, -1); e[i] = 0; while (!d.empty()) { for (pair<int, int>& j : c[d.front()]) { if (-1 == e[j.first]) { d.push(j.first); e[j.first] = e[d.front()] + j.second; } } d.pop(); } sort(e.begin(), e.end()); ans = min(ans, e.back()); } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - バスと避けられない運命 |
User | Mcpu3 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 764 Byte |
Status | WA |
Exec Time | 58 ms |
Memory | 1536 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | 2 ms | 256 KB |
sample_03.txt | AC | 2 ms | 256 KB |
test_01.txt | AC | 2 ms | 256 KB |
test_02.txt | AC | 6 ms | 256 KB |
test_03.txt | WA | 58 ms | 1536 KB |
test_04.txt | WA | 6 ms | 256 KB |
test_05.txt | WA | 22 ms | 640 KB |
test_06.txt | WA | 4 ms | 384 KB |
test_07.txt | WA | 45 ms | 1408 KB |
test_08.txt | WA | 2 ms | 256 KB |
test_09.txt | WA | 17 ms | 640 KB |
test_10.txt | WA | 4 ms | 384 KB |
test_11.txt | WA | 4 ms | 384 KB |
test_12.txt | WA | 10 ms | 384 KB |
test_13.txt | WA | 5 ms | 384 KB |
test_14.txt | WA | 6 ms | 384 KB |
test_15.txt | WA | 42 ms | 1408 KB |
test_16.txt | WA | 6 ms | 384 KB |
test_17.txt | WA | 18 ms | 640 KB |
test_18.txt | WA | 10 ms | 384 KB |
test_19.txt | WA | 7 ms | 384 KB |
test_20.txt | WA | 6 ms | 384 KB |
test_21.txt | WA | 2 ms | 256 KB |
test_22.txt | WA | 7 ms | 384 KB |
test_23.txt | WA | 2 ms | 256 KB |
test_24.txt | AC | 5 ms | 256 KB |
test_25.txt | WA | 6 ms | 256 KB |
test_26.txt | AC | 3 ms | 256 KB |
test_27.txt | WA | 3 ms | 256 KB |
test_28.txt | AC | 5 ms | 256 KB |
test_29.txt | WA | 6 ms | 256 KB |
test_30.txt | AC | 2 ms | 256 KB |
test_31.txt | WA | 2 ms | 256 KB |
test_32.txt | AC | 5 ms | 256 KB |
test_33.txt | AC | 6 ms | 256 KB |
test_34.txt | AC | 2 ms | 256 KB |
test_35.txt | WA | 3 ms | 256 KB |
test_36.txt | AC | 5 ms | 256 KB |