Cod sursa(job #854578)

Utilizator SebiSebiPirtoaca George Sebastian SebiSebi Data 13 ianuarie 2013 19:15:14
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include<fstream>
#include<vector>
#include<string.h>
using namespace std;

#define NMAX 10001

vector <int> v[NMAX];
int st[NMAX],dr[NMAX],viz[NMAX];

int cupleaza(int nod)
{
	viz[nod]=1;
	for(vector <int> :: iterator it=v[nod].begin();it!=v[nod].end();it++) 
		if(dr[*it]==0) {
			st[nod]=*it;
			dr[*it]=nod;
			return 1;
		}
		else if(viz[dr[*it]]==0) {
			if(cupleaza(dr[*it])) {
				st[nod]=*it;
				dr[*it]=nod;
				return 1;
			}
		}
	return 0;
}

int main ()
{
	int n1,n2,m,i,x,y,cuplaj;
	ifstream f("cuplaj.in");
	ofstream g("cuplaj.out");
	f>>n1>>n2>>m;
	for(i=1;i<=m;i++) {
		f>>x>>y;
		v[x].push_back(y);
	}
	f.close();
	cuplaj=0;
	for(i=1;i<=n1;i++)
		if(st[i]==0) {
			if(cupleaza(i))
				cuplaj++;
			else {
				memset(viz,0,sizeof(viz));
				cuplaj=cuplaj+cupleaza(i);
			}
		}
	g<<cuplaj<<'\n';
	for(i=1;i<=n1;i++)
		if(st[i])
			g<<i<<" "<<st[i]<<'\n';
	g.close();
	return 0;
}