Pagini recente » Monitorul de evaluare | Cod sursa (job #2921930) | Cod sursa (job #2096117) | Cod sursa (job #154561) | Cod sursa (job #3147193)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
typedef long long ll;
int viz[10005],cuplat[10005],p[10005];
vector <int> v[10005];
int l,r,m,x,y,nr;
bool dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(p[v[nod][i]]==0||(viz[p[v[nod][i]]]==0&&dfs(p[v[nod][i]])==1))
{
p[v[nod][i]]=nod;
cuplat[nod]=1;
return 1;
}
return 0;
}
void cuplaj()
{
bool ok=1;
while(ok)
{
ok=0;
for(int i=1;i<=l;i++)
viz[i]=0;
for(int i=1;i<=l;i++)
if(cuplat[i]==0&&dfs(i)==1)
{
nr++;
ok=1;
}
}
}
int main()
{
fin>>l>>r>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
cuplaj();
fout<<nr<<'\n';
for(int i=1;i<=r;i++)
if(p[i]!=0)
{
fout<<p[i]<<' '<<i<<'\n';
}
return 0;
}