Pagini recente » Cod sursa (job #2532646) | Cod sursa (job #1592259) | Cod sursa (job #2430568) | Cod sursa (job #2961269) | Cod sursa (job #2742661)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n,m,e,l[10005],r[10005];
vector<int> muchii[10005];
bool use[10005];
bool pairup(int nod)
{
if(use[nod])
return 0;
use[nod]=1;
for(auto i:muchii[nod])
if(r[i]==0)
{
r[i]=nod;
l[nod]=i;
return 1;
}
for(auto i:muchii[nod])
if(pairup(r[i]))
{
r[i]=nod;
l[nod]=i;
return 1;
}
return 0;
}
int main()
{
ios_base::sync_with_stdio(false);
fin.tie(0);
fout.tie(0);
fin>>n>>m>>e;
for(int i=1;i<=e;i++)
{
int a,b;
fin>>a>>b;
muchii[a].push_back(b);
}
bool ok=1;
while(ok)
{
ok=0;
memset(use,0,sizeof(use));
for(int i=1;i<=n;i++)
if(!l[i])
ok|=pairup(i);
}
int cuplaj=0;
for(int i=1;i<=n;i++)
if(l[i])
cuplaj++;
fout<<cuplaj<<'\n';
for(int i=1;i<=n;i++)
if(l[i])
fout<<i<<" "<<l[i]<<'\n';
return 0;
}