test/cpv/aizu-alds1/alds1_12_c.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_12_C | ||
| 2 | #include "../../../src/graph/ds/alist/lib.hpp" | ||
| 3 | #include "../../../src/graph/sp/dijkstra/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 8 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
|
8 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n; | ||
| 9 |
1/2✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
|
8 | std::cin >> n; |
| 10 | 8 | alist<u64> g(n); | |
| 11 |
2/2✓ Branch 0 taken 11209 times.
✓ Branch 1 taken 8 times.
|
11217 | for (u32 i = 0, u, k; i < n; ++i) { |
| 12 |
2/4✓ Branch 1 taken 11209 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 11209 times.
✗ Branch 5 not taken.
|
11209 | std::cin >> u >> k; |
| 13 |
2/2✓ Branch 0 taken 722421 times.
✓ Branch 1 taken 11209 times.
|
733630 | for (u32 j = 0, v, c; j < k; ++j) { |
| 14 |
2/4✓ Branch 1 taken 722421 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 722421 times.
✗ Branch 5 not taken.
|
722421 | std::cin >> v >> c; |
| 15 | 722421 | g.add_arc(u, v, c); | |
| 16 | } | ||
| 17 | } | ||
| 18 | 8 | auto dis = dijkstra(g, 0, fn_0); | |
| 19 |
6/10✓ Branch 1 taken 11209 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 11209 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 11209 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 11209 times.
✗ Branch 12 not taken.
✓ Branch 13 taken 11209 times.
✓ Branch 14 taken 8 times.
|
11217 | flt_ (u32, i, 0, n) std::cout << i << ' ' << dis[i] << '\n'; |
| 20 | 8 | return 0; | |
| 21 | 8 | } | |
| 22 |