| 5 | #include "dinic.h" |
| 6 | |
| 7 | int main(){ |
| 8 | Dinic solver(10, 8, 9); |
| 9 | int C = (int)1e8; |
| 10 | long long inf = (long long)1e15; |
| 11 | solver.add_edge(8, 0, C); |
| 12 | solver.add_edge(8, 1, C); |
| 13 | solver.add_edge(8, 2, C); |
| 14 | solver.add_edge(8, 3, C); |
| 15 | solver.add_edge(0, 4, inf); |
| 16 | solver.add_edge(1, 5, inf); |
| 17 | solver.add_edge(2, 6, inf); |
| 18 | solver.add_edge(3, 7, inf); |
| 19 | solver.add_edge(4, 9, C + 2); |
| 20 | solver.add_edge(5, 9, C - 2); |
| 21 | solver.add_edge(6, 9, C - 1); |
| 22 | solver.add_edge(7, 9, C + 1); |
| 23 | solver.add_edge(0, 6, inf); |
| 24 | solver.add_edge(0, 7, inf); |
| 25 | solver.add_edge(1, 7, inf); |
| 26 | solver.add_edge(2, 7, inf); |
| 27 | solver.add_edge(4, 1, inf); |
| 28 | solver.add_edge(4, 2, inf); |
| 29 | solver.add_edge(5, 3, inf); |
| 30 | solver.add_edge(6, 3, inf); |
| 31 | assert(solver.flow() == 4 * C - 2); |
| 32 | return 0; |
| 33 | } |
nothing calls this directly
no outgoing calls
no test coverage detected