Submission #1481948
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <utility> using namespace std; using llng = long long; template<typename T> using v = vector<T>; template<typename T> using vv = v<v<T> >; int main() { int N, M; cin >> N >> M; vv<int> d(N+1, v<int>(N+1, 1e9)); for (int i=0; i<=N; i++) d[i][i] = 0; v<int> s; for (int i=0; i<M; i++) { int u, v, l; cin >> u >> v >> l; d[u][v] = d[v][u] = l; if (u == 1) s.push_back(v); } for (int k=2; k<=N; k++) { for (int i=2; i<=N; i++) for (int j=2; j<=N; j++) { d[i][j] = min(d[i][j], d[i][k] + d[k][j]); } } int ans = 1e9; for (int i=0; i<s.size(); i++) { for (int j=i+1; j<s.size(); j++) { ans = min(ans, d[1][s[i]] + d[s[i]][s[j]] + d[s[j]][1]); } } if (ans == 1e9) cout << -1 << endl; else cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Blue Bird |
User | hidollara |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 960 Byte |
Status | AC |
Exec Time | 67 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 17 ms | 384 KB |
subtask1_02.txt | AC | 17 ms | 384 KB |
subtask1_03.txt | AC | 40 ms | 512 KB |
subtask1_04.txt | AC | 1 ms | 256 KB |
subtask1_05.txt | AC | 9 ms | 384 KB |
subtask1_06.txt | AC | 40 ms | 512 KB |
subtask1_07.txt | AC | 4 ms | 256 KB |
subtask1_08.txt | AC | 4 ms | 256 KB |
subtask1_09.txt | AC | 38 ms | 512 KB |
subtask1_10.txt | AC | 17 ms | 384 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 20 ms | 512 KB |
subtask1_13.txt | AC | 6 ms | 256 KB |
subtask1_14.txt | AC | 3 ms | 256 KB |
subtask1_15.txt | AC | 66 ms | 640 KB |
subtask1_16.txt | AC | 48 ms | 640 KB |
subtask1_17.txt | AC | 38 ms | 640 KB |
subtask1_18.txt | AC | 53 ms | 640 KB |
subtask1_19.txt | AC | 52 ms | 640 KB |
subtask1_20.txt | AC | 43 ms | 640 KB |
subtask1_21.txt | AC | 43 ms | 640 KB |
subtask1_22.txt | AC | 63 ms | 640 KB |
subtask1_23.txt | AC | 67 ms | 640 KB |
subtask1_24.txt | AC | 42 ms | 640 KB |
subtask1_25.txt | AC | 49 ms | 640 KB |
subtask1_26.txt | AC | 61 ms | 640 KB |
subtask1_27.txt | AC | 56 ms | 640 KB |
subtask1_28.txt | AC | 40 ms | 768 KB |
subtask1_29.txt | AC | 61 ms | 640 KB |
subtask1_30.txt | AC | 37 ms | 640 KB |