Pagini recente » Cod sursa (job #259792) | Cod sursa (job #2625539) | Cod sursa (job #1934027) | Cod sursa (job #745428) | Cod sursa (job #603908)
Cod sursa(job #603908)
#include <iostream>
#include <vector>
#define NMax 10005
using namespace std;
vector <int> G[NMax];
int N, M, L[NMax], R[NMax], Cuplaj;
bool Viz[NMax];
void Read ()
{
freopen ("cuplaj.in", "r", stdin);
int E;
scanf ("%d %d %d", &N, &M, &E);
for (; E>0; --E)
{
int X, Y;
scanf ("%d %d", &X, &Y);
G[X].push_back (Y);
}
}
void Print ()
{
freopen ("cuplaj.out", "w", stdout);
printf ("%d\n", Cuplaj);
for (int i=1; i<=N; ++i)
{
if (L[i]!=0)
{
printf ("%d %d\n", i, L[i]);
}
}
}
int PairUp (int X)
{
if (Viz[X])
{
return 0;
}
Viz[X]=true;
for (unsigned v=0; v<G[X].size (); ++v)
{
int V=G[X][v];
if (R[V]==0)
{
L[X]=V;
R[V]=X;
return 1;
}
}
for (unsigned v=0; v<G[X].size (); ++v)
{
int V=G[X][v];
if (PairUp (R[V])==1)
{
L[X]=V;
R[V]=X;
return 1;
}
}
return 0;
}
int main()
{
Read ();
for (int Change=1; Change; )
{
Change=0;
for (int i=1; i<=N; ++i)
{
Viz[i]=false;
}
for (int i=1; i<=N; ++i)
{
if (L[i]==0)
{
Change|=PairUp (i);
}
}
}
Cuplaj=0;
for (int i=1; i<=N; ++i)
{
if (L[i]!=0)
{
++Cuplaj;
}
}
Print ();
return 0;
}