Maximum Flow Value

Challenge on lesson: Checkpoint — Flow Value

CHALLENGE

Difficulty: advanced+25 XP

**Bài toán.** Line 1: n m s t. Then m lines u v c — a directed edge with capacity c. Print the MAXIMUM FLOW from s to t. **Constraints:** 1 ≤ n, m ≤ 100 000; 1 ≤ c ≤ 10^9. Dinic on a layered network: the answer is the total across a cut, not one route's capacity.

Press Submit to check your solution.

Back to lesson: Checkpoint — Flow Value