Pagini recente » Cod sursa (job #1138800) | Istoria paginii runda/simulare_oji_2023_clasele_11_12_16_martie3/clasament | Cod sursa (job #2645846) | Cod sursa (job #2801736) | Cod sursa (job #2175428)
#include <cstdio>
#include <vector>
using namespace std;
int cup1[10010],cup2[10010];
char vaz[10010];
vector<int> v[10010];
int cupleaza(int nod)
{
if(vaz[nod]==1) return 0;
vaz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(cup2[v[nod][i]]==0)
{
cup1[nod]=v[nod][i];
cup2[v[nod][i]]=nod;
return 1;
}
for(int i=0;i<v[nod].size();i++)
if(cupleaza(cup2[v[nod][i]])==1)
{
cup1[nod]=v[nod][i];
cup2[v[nod][i]]=nod;
return 1;
}
return 0;
}
int main()
{
freopen("cuplaj.in","r",stdin);
freopen("cuplaj.out","w",stdout);
int n,m,e,x,y;
scanf("%d%d%d",&n,&m,&e);
for(int i=1;i<=e;i++)
{
scanf("%d%d",&x,&y);
v[x].push_back(y);
}
int ok=1;
while(ok>0)
{
ok=0;
for(int i=1;i<=n;i++) vaz[i]=0;
for(int i=1;i<=n;i++)
if(cup1[i]==0) ok+=cupleaza(i);
}
int sol=0;
for(int i=1;i<=n;i++)
if(cup1[i]>0) sol++;
printf("%d\n",sol);
for(int i=1;i<=n;i++)
if(cup1[i]>0) printf("%d %d\n",i,cup1[i]);
return 0;
}