Job Assignment Fair
L workers and R jobs; each listed pair (worker, job) is compatible. Each worker takes at most one job and vice versa. Print the maximum number of filled jobs.
Input: the first line has L, R and M; each of the next M lines has a compatible pair u v.
Output: the maximum matching size.
Constraints:
- 1 ≤ L, R ≤ 500
- 0 ≤ M ≤ 104
Sample Tests
Input 1
3 3 4 1 1 1 2 2 1 3 3
Output 1
3
Input 2
1 1 0
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.