-
Notifications
You must be signed in to change notification settings - Fork 1
/
matching.cpp
45 lines (41 loc) · 840 Bytes
/
matching.cpp
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
int n, k;
vector<vector<int>> g;
vector<int> mt;
vector<char> used;
bool try_kuhn (int v) {
if (used[v]) return false;
used[v] = true;
for (int i = 0; i < g[v].size(); ++i) {
int to = g[v][i];
if (mt[to] == -1) {
mt[to] = v;
return true;
}
}
for (int i = 0; i < g[v].size(); ++i) {
int to = g[v][i];
if (try_kuhn(mt[to])) {
mt[to] = v;
return true;
}
}
return false;
}
int main() {
mt.assign(k, -1);
// used.assign(n, false);
// for (int v = 0; v < n; ++v) {
// if (try_kuhn (v)
// used.assign(n, false);
// }
for (int run = 1; run; ) {
run = 0;
used.assign(n, false);
for (int i = 0; i < n; i++)
if (mt[i] == -1 && dfs(i))
run = 1;
}
for (int i = 0; i < k; ++i)
if (mt[i] != -1)
printf ("%d %d\n", mt[i]+1, i+1);
}