Pagini recente » Cod sursa (job #2714440) | Cod sursa (job #1691444) | Cod sursa (job #738862) | Cod sursa (job #571806) | Cod sursa (job #1637564)
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<vector<int>> al;
vector<int> mt;
vector<bool> vis;
bool dfs(int u) {
vis[u] = true;
for (int v: al[u]) {
if (mt[v] == -1 || !vis[mt[v]] && dfs(mt[v])) {
mt[v] = u;
mt[u] = v;
return true;
}
}
return false;
}
int main() {
#ifdef INFOARENA
freopen("cuplaj.in", "r", stdin);
freopen("cuplaj.out", "w", stdout);
#endif
cin.sync_with_stdio(false);
int n0, n1, m;
cin >> n0 >> n1 >> m;
al.resize(n0);
mt.assign(n0+n1, -1);
for (int u, v, i = 0; i < m; i++) {
cin >> u >> v;
u--;
v += n0-1;
al[u].push_back(v);
}
int nm = 0;
for (int u = 0; u < n0; u++) {
for (int v: al[u]) {
if (mt[v] == -1) {
mt[v] = u;
mt[u] = v;
nm++;
break;
}
}
}
for (int u = 0; u < n0; u++) {
vis.assign(n0, false);
if (mt[u] == -1 && !vis[u] && dfs(u)) {
nm++;
}
}
printf("%d\n", nm);
for (int u = 0; u < n0; u++) {
if (mt[u] != -1)
printf("%d %d\n", u+1, mt[u]-n0+1);
}
return 0;
}