test/cpv/aizu-grl/grl_6_a.hlpp.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/all/GRL_6_A/ | ||
| 2 | #include "../../../src/graph/nf/hlpp/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 40 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 40 times.
✗ Branch 3 not taken.
|
40 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u32 n, m; | ||
| 8 |
2/4✓ Branch 1 taken 40 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 40 times.
✗ Branch 5 not taken.
|
40 | std::cin >> n >> m; |
| 9 | 40 | hlpp maxflow(n, 0, n - 1); | |
| 10 |
5/8✓ Branch 1 taken 9145 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 9145 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 9145 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 9145 times.
✓ Branch 11 taken 40 times.
|
9185 | for (u32 i = 0, u, v, w; i < m; ++i) std::cin >> u >> v >> w, maxflow.add(u, v, w); |
| 11 |
2/4✓ Branch 2 taken 40 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 40 times.
✗ Branch 6 not taken.
|
40 | std::cout << maxflow.get() << '\n'; |
| 12 | 40 | return 0; | |
| 13 | 40 | } | |
| 14 |