Pagini recente » Cod sursa (job #799641) | Cod sursa (job #1411361) | Cod sursa (job #679405) | Cod sursa (job #2388473) | Cod sursa (job #2301420)
#include <bits/stdc++.h>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
int n,m,e,viz[10005],stanga[10005],dreapta[10005],sol[10005];
vector <int> lista[10005];
bool gasesc_cuplaj(int node)
{
if(viz[node]) return false;
viz[node]=1;
for(auto x:lista[node])
{
if(!stanga[x] || gasesc_cuplaj(stanga[x]))
{
stanga[x]=node;
dreapta[node]=x;
return true;
}
}
return false;
}
int main()
{
in >> n >> m >> e;
for(int i=1; i<=e; i++)
{
int x,y;
in >> x >> y;
lista[x].push_back(y);
}
bool ok=true;
while(ok)
{
ok=false;
memset(viz,0,sizeof(viz));
for(int i=1; i<=n; i++)
{
if(!dreapta[i])
{
ok|=gasesc_cuplaj(i);
}
}
}
int nr=0;
for(int i=1; i<=n; i++)
{
if(dreapta[i])
sol[++nr]=i;
}
out << nr << '\n';
for(int i=1; i<=nr; i++)
{
out << sol[i] << ' ' << dreapta[sol[i]] << '\n';
}
return 0;
}