Pagini recente » Cod sursa (job #737647) | Cod sursa (job #820307) | Cod sursa (job #2943317) | Cod sursa (job #1416558) | Cod sursa (job #2539627)
#include <bits/stdc++.h>
#define Dim 10001
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int L,R,E,a,b,LR[Dim],RL[Dim],ans,cnt;
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( !RL[vecin] )
{
RL[vecin]=nod;
LR[nod]=vecin;
return true;
}
}
for(unsigned int i=0;i<V[nod].size();i++)
{
int vecin=V[nod][i];
if( Hopcroft( RL[vecin] ) )
{
RL[vecin]=nod;
LR[nod]=vecin;
return true;
}
}
return false;
}
int main()
{
f>>L>>R>>E;
for(int i=1;i<=E;i++)
{
f>>a>>b;
V[a].push_back(b);
}
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(!LR[i])
{
bool op=Hopcroft(i);
if(op)
{
ok=1;
cnt++;
}
}
}
g<<cnt<<'\n';
for(unsigned int i=1;i<=L;i++)
if( LR[i] ) g<<i<<' '<<LR[i]<<'\n';
return 0;
}