Cod sursa(job #530148)

Utilizator PlayLikeNeverB4George Marcus PlayLikeNeverB4 Data 7 februarie 2011 00:31:35
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");

#define maxn 10005

vector <int> A[maxn];
int i,N,M,E,NR,ok;
bool v[maxn];
int L[maxn],R[maxn];

void citire()
{
	int x,y;
	fin >> N >> M >> E;
	for(i=1;i<=E;i++)
	{
		fin >> x >> y;
		A[x].push_back(y);
	}
}

int pairup(int x)
{
	vector <int> :: iterator it;
	if(v[x]) return 0;
	v[x]=true;
	for(it=A[x].begin();it!=A[x].end();it++)
		if( R[*it]==0 || pairup(R[*it]) )
		{
			L[x]=*it; R[*it]=x; return 1;
		}
	return 0;
}

int main()
{
	citire();
	ok=1;
	while(ok)
	{
		ok=0;
		for(i=0;i<=N;i++) v[i]=0;
		for(i=1;i<=N;i++)
			if(L[i]==0)
				if( pairup(i) )
				{
					NR++;
					ok=1;
				}
	}
	fout << NR << '\n';
	for(i=1;i<=N;i++)
		if(L[i]>0)
			fout << i << " " << L[i] << '\n';
}