Pagini recente » Cod sursa (job #2770730) | Cod sursa (job #1026316) | Cod sursa (job #1600525) | Cod sursa (job #1951483) | Cod sursa (job #1431214)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
vector <int> v[11000];
int viz[11000],numar,n,m,e,i,j,x,y,stanga[11000],dreapta[11000],ok;
int pair_up(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
{ int nod1=v[nod][i];
if(stanga[nod1]==0)
{
dreapta[nod]=nod1;
stanga[nod1]=nod;
return 1;
}
if(viz[stanga[nod1]]==0)
if(pair_up(stanga[nod1])==1)
{
stanga[nod1]=nod;
dreapta[nod]=nod1;
return 1;
}
}
return 0;
}
int main()
{
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
f>>n>>m>>e;
for(i=1;i<=e;i++)
{
f>>x>>y;
v[x].push_back(y);
}
ok=1;numar=0;
while(ok==1)
{
ok=0;
for(j=1;j<=n;j++) viz[j]=0;
for(j=1;j<=n;j++)
if(dreapta[j]==0)
if(viz[j]==0)
ok=pair_up(j);
}
for(i=1;i<=m;i++)
if(stanga[i]!=0) numar++;
g<<numar<<"\n";
for(i=1;i<=m;i++)
if(stanga[i]!=0)
g<<stanga[i]<<" "<<i<<"\n";
return 0;
}