Pagini recente » Cod sursa (job #1840958) | Rezultatele filtrării | Rezultatele filtrării | Cod sursa (job #299826) | Cod sursa (job #2774463)
#include<cstdio>
#include<cstring>
#include<vector>
#define N 10001
using namespace std;
vector<int> g[N];
int l[N],r[N],n,m,e,c=1,i,j;
bool u[N];
int P(int n)
{
if(u[n])
return 0;
u[n]=1;
int i,j=g[n].size();
for(i=0;i<j;i++)
if(!r[g[n][i]]) {
l[n]=g[n][i],r[g[n][i]]=n;
return 1;
}
for(i=0;i<j;i++)
if(P(r[g[n][i]])) {
l[n]=g[n][i],r[g[n][i]]=n;
return 1;
}
return 0;
}
int main()
{
freopen("cuplaj.in","r",stdin),freopen("cuplaj.out","w",stdout),scanf("%d%d%d",&n,&m,&e);
while(e--)
scanf("%d%d",&i,&j),g[i].push_back(j);
while(c)
for(c=0,memset(u,0,sizeof(u)),i=1;i<=n;++i)
if(!l[i])
c|=P(i);
for(j=0,i=1;i<=n;++i)
j+=(l[i]>0);
for(printf("%d\n",j),i=1;i<=n;++i)
if(l[i]>0)
printf("%d %d\n",i,l[i]);
return 0;
}