/
BOJ_11378_3.java
68 lines (64 loc) · 2.02 KB
/
BOJ_11378_3.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
int[] matched;
boolean[] v;
int[][] edges;
private boolean matching(int cur) {
for (int i = 0; i < edges[cur].length; i++) {
int next = edges[cur][i];
if (v[next]) continue;
v[next] = true;
if (matched[next] == -1 || matching(matched[next])) {
matched[next] = cur;
return true;
}
}
return false;
}
private void solution() throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int n = Integer.parseInt(st.nextToken());
int m = Integer.parseInt(st.nextToken());
int k = Integer.parseInt(st.nextToken());
matched = new int[m+1];
Arrays.fill(matched, -1);
v = new boolean[m+1];
edges = new int[n+1][];
for (int i = 1; i <= n; i++) {
st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken());
edges[i] = new int[a];
for (int j = 0; j < a; j++) {
edges[i][j] = Integer.parseInt(st.nextToken());
}
}
int sum = 0;
for (int i = 1; i <= n && sum < m; i++) {
if (matching(i)) {
sum++;
v = new boolean[m+1];
}
}
while (true) {
int tmp = 0;
for (int i = 1; i <= n && sum < m && k > 0; i++) {
if (matching(i)) {
tmp++;
k--;
v = new boolean[m+1];
}
}
sum += tmp;
if (tmp == 0 || sum >= m || k == 0)
break;
}
System.out.println(sum);
}
public static void main(String[] args) throws Exception {
new Main().solution();
}
}