Pagini recente » Cod sursa (job #1224401) | Cod sursa (job #168606) | Cod sursa (job #2502889) | Cod sursa (job #264594) | Cod sursa (job #2242074)
#include <bits/stdc++.h>
using namespace std;
vector<int>G[10002];
int st[10002], dr[10002];
int n, m, e, x, y;
bool viz[10002];
ifstream fin ("cuplaj.in");
ofstream fout ("cuplaj.out");
bool cuplaj (int x) {
if (viz[x])
return 0;
viz[x] = 1;
for (int i = 0; i < G[x].size(); i++) {
int v = G[x][i];
if (!dr[v]) {
st[x] = v;
dr[v] = x;
return 1;
}
}
for (int i = 0; i < G[x].size(); i++) {
int v = G[x][i];
if (cuplaj(dr[v])) {
st[x] = v;
dr[v] = x;
return 1;
}
}
return 0;
}
int main()
{
fin >> n >> m >> e;
for (int i = 1; i <= e; i++) {
fin >> x >> y;
G[x].push_back(y);
}
bool ok = 1;
while (ok) {
ok = 0;
memset(viz, 0, sizeof(viz));
for (int i = 1; i <= n; i++) {
if (!st[i])
if (cuplaj(i))
ok = 1;
}
}
int sol = 0;
for (int i = 1; i <= n; i++)
if (st[i])
sol++;
fout << sol << "\n";
for (int i = 1; i <= n; i++)
if (st[i])
fout << i << " " << st[i] << "\n";
return 0;
}