Pagini recente » Cod sursa (job #1476962) | Cod sursa (job #2468006) | Cod sursa (job #2660564) | Cod sursa (job #1365508) | Cod sursa (job #2666615)
#include <bits/stdc++.h>
#define dim 10010
using namespace std;
vector <int> a[dim];
bitset<dim> f;
int l[dim];
int r[dim];
int i,n,m,q,sol,ok,x,y;
int cuplaj (int nod) {
if (f[nod]==1) return 0;
f[nod]=1;
for (int i=0;i<a[nod].size();i++) {
int vecin=a[nod][i];
if (r[vecin]==0) {
r[vecin]=nod;
l[nod]=vecin;
sol++;
return 1;
}
}
for (int i=0;i<a[nod].size();i++) {
int vecin=a[nod][i];
if (cuplaj(r[vecin])) {
r[vecin]=nod;
l[nod]=vecin;
return 1;
}
}
return 0;
}
int main() {
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
fin>>n>>m>>q;
for (;q--;) {
fin>>x>>y;
a[x].push_back(y);
}
ok=1;
while (ok) {
ok=0;
f.reset();
for (i=1;i<=n;i++) {
if (l[i]==0&&cuplaj(i)) {
ok=1;
}
}
}
fout<<sol<<"\n";
for (i=1;i<=n;i++) {
if (l[i]) fout<<i<<" "<<l[i]<<"\n";
}
return 0;
}