Cod sursa(job #795299)

Utilizator radustn92Radu Stancu radustn92 Data 8 octombrie 2012 00:37:28
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <stdio.h>
#include <vector>
#include <string.h>
#define NMAX 10005
#define pb push_back
using namespace std;
int n,m,e,st[NMAX],dr[NMAX],rez;
vector <int> A[NMAX];
char marc[NMAX];
void read()
{
	scanf("%d%d%d",&n,&m,&e);
	int i,x,y;
	for (i=1; i<=e; i++)
	{
		scanf("%d%d",&x,&y);
		A[x].pb(y); 
	}
}
int match(int nod)
{
	marc[nod]=1;
	int i,vec;
	for (i=0; i<A[nod].size(); i++)
	{
		vec=A[nod][i];
		if (!dr[vec])
		{
			st[nod]=vec;
			dr[vec]=nod;
			return 1;
		}
	}
	for (i=0; i<A[nod].size(); i++)
	{
		vec=A[nod][i];
		if (!marc[dr[vec]] && match(dr[vec]))
		{
			st[nod]=vec;
			dr[vec]=nod;
			return 1;
		}
	}
	return 0;
}
void solve()
{
	int i,fin=1;
	while (fin)
	{
		memset(marc,0,sizeof(marc));
		fin=0;
		for (i=1; i<=n; i++)
			if (!st[i] && match(i))
				rez++,fin=1;
	}
	printf("%d\n",rez);
	for (i=1; i<=n; i++)
		if (st[i])
			printf("%d %d\n",i,st[i]);
}
int main()
{
	freopen("cuplaj.in","r",stdin);
	freopen("cuplaj.out","w",stdout);
	read();
	solve();
	return 0;
}