Pagini recente » Cod sursa (job #348160) | Cod sursa (job #2588721) | Cod sursa (job #2239896) | Cod sursa (job #675920) | Cod sursa (job #2566254)
#include <bits/stdc++.h>
#define Dim 10001
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int L,R,M,LtoR[Dim],RtoL[Dim],a,b,ans;
bool viz[Dim];
vector < int > V[Dim];
bool Hopcroft(int nod)
{
if( viz[nod] ) return false;
viz[nod]=1;
for(unsigned int i=0;i<V[nod].size();i++)
{
int vecin=V[nod][i];
if( RtoL[vecin] == 0 )
{
LtoR[nod]=vecin;
RtoL[vecin]=nod;
return true;
}
}
for(unsigned int i=0;i<V[nod].size();i++)
{
int vecin=V[nod][i];
if( Hopcroft( RtoL[vecin] ) )
{
LtoR[nod]=vecin;
RtoL[vecin]=nod;
return true;
}
}
return false;
}
int main()
{
f>>L>>R>>M;
for(int i=1;i<=M;i++)
{
f>>a>>b;
V[a].push_back(b);
}
bool stop=0;
while(!stop)
{
stop=1;
for(int i=1;i<=L;i++) viz[i]=0;
for(int i=1;i<=L;i++)
if( !LtoR[i] )
{
bool op=Hopcroft( i );
if( op )
{
stop=0;
ans++;
}
}
}
g<<ans<<'\n';
for(int i=1;i<=L;i++)
if(LtoR[i]) g<<i<<' '<<LtoR[i]<<'\n';
return 0;
}