Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Job Assignment Fair

Job Assignment Fair

Difficulty: 2000 4000 ms 128 MB

graphs matching

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

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen