Pagini recente » Cod sursa (job #2371219) | Cod sursa (job #180674) | Cod sursa (job #653922) | Cod sursa (job #2802905) | Cod sursa (job #719160)
Cod sursa(job #719160)
#include<stdio.h>
#include<vector>
using namespace std;
vector<int>g[10213];
int m,n,p,i,j,k,q,l[10213],r[10213];
bool ok,f[10213];
bool pairup(int x)
{
vector<int>::iterator it;
if(f[x])return 0;
f[x]=1;
for(it=g[x].begin();it!=g[x].end();++it)
if(!r[*it])
{
l[x]=*it;
r[*it]=x;
return 1;
}
for(it=g[x].begin();it!=g[x].end();++it)
if(pairup(*it))
{
l[x]=*it;
r[*it]=x;
return 1;
}
return 0;
}
int main()
{
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
scanf("%d%d%d",&n,&m,&p);
for(i=0;i<p;++i)
{
scanf("%d%d",&j,&k);
g[j].push_back(k);
}
ok=1;
while(ok)
{
ok=0;
for(i=1;i<10213;++i)f[i]=0;
for(i=1;i<=n;++i)if(!l[i]) if(pairup(i))ok=1;
}
q=0;
for(i=1;i<=n;++i) if(l[i])++q;
printf("%d\n",q);
for(i=1;i<=n;++i)
if(l[i])
printf("%d %d\n",i,l[i]);
return 0;
}