Skip to main content

Practice · 2 of 3

Bipartite Matching

CHALLENGE
Difficulty: advanced+25 XP

**Bài toán.** Line 1: L R m; then m lines u v — left node u compatible with right node v. Print the MAXIMUM MATCHING size. **Constraints:** 1 ≤ L, R, m ≤ 2000. Model as flow: source→left→right→sink, all caps 1. Greedy without augmenting paths undercounts on the right graph.

Back to lesson: Practice: Flow Trio