Pagini recente » Cod sursa (job #1505660) | Cod sursa (job #2479875) | Cod sursa (job #493134) | Cod sursa (job #2716768) | Cod sursa (job #594426)
Cod sursa(job #594426)
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
vector <int> g[10001];
int l[10001],r[10001],u[10001];
int pairup(int x)
{
if (u[x]) return 0;
unsigned int i;
u[x]=1;
for (i=0;i<g[x].size();++i)
if (!r[g[x][i]])
{
l[x]=g[x][i];
r[g[x][i]]=x;
return 1;
}
for (i=0;i<g[x].size();++i)
if (pairup(r[g[x][i]]))
{
l[x]=g[x][i];
r[g[x][i]]=x;
return 1;
}
return 0;
}
int main()
{
int n,m,nr,ok,sol=0,x,y,i;
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
scanf("%d %d %d\n",&n,&m,&nr);
for (i=1;i<=nr;++i)
{
scanf("%d %d\n",&x,&y);
g[x].push_back(y);
}
for (ok=1;ok;)
{
ok=0;
memset(u,0,sizeof(u));
for (i=1;i<=n;++i)
if (!l[i])
ok|=pairup(i);
}
for (i=1;i<=n;++i)
sol+=(l[i]>0);
printf("%d\n",sol);
for (i=1;i<=n;++i)
if (l[i]>0)
printf("%d %d\n",i,l[i]);
return 0;
}