Pagini recente » Cod sursa (job #866474) | Istoria paginii utilizator/puficarina | Istoria paginii utilizator/sliviu | Rating Munteanu Theodor (TheodorMunteanu) | Cod sursa (job #1011514)
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector <int> G[10005];
int ind,ind2;
bool Use[10005];
int L[10005],R[10005];
int N,M,E;
void Read()
{
int i,j,value;
f>>N>>M>>E;
for(i=1;i<=E;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
}
}
bool pairup(int n)
{
unsigned int i=0;
if(Use[n]==1)
return 0;
Use[n]=1;
for(i=0;i<G[n].size();i++)
{
int vecin=G[n][i];
if(R[vecin]==0)
{
R[vecin]=n;
L[n]=vecin;
return 1;
}
}
for(i=0;i<G[n].size();i++)
{
int vecin=G[n][i];
if(pairup(R[vecin])==1)
{
R[vecin]=n;
L[n]=vecin;
return 1;
}
}
return 0;
}
void Cuplaj()
{
int i,cuplaj=0;
bool change=1;
while(change==1)
{
change=0;
memset(Use,0,sizeof(Use));
for(i=1;i<=N;i++)
if(L[i]==0)
change |=pairup(i);
}
for(i=1;i<=N;i++)
if(L[i]>0)
cuplaj++;
g<<cuplaj<<"\n";
for(i=1;i<=N;i++)
if(L[i]>0)
g<<i<<" "<<L[i]<<"\n";
}
int main()
{
Read();
Cuplaj();
return 0;
}