Cod sursa(job #727901)

Utilizator ms-ninjacristescu liviu ms-ninja Data 28 martie 2012 12:50:11
Problema Felinare Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.93 kb
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("felinare.in");
ofstream fout("felinare.out");
#define dim 20006
vector <int> v[dim];
int viz[dim],a[dim], b[dim],n,m;

void read()
{
	int i, x, y;
	fin>>n >>m;
	for(i=1;i<=m;++i)
	{
		fin>>x >>y;
		v[x].push_back(y);
	}
}

int pairup(int nod)
{
	if(viz[nod])
		return 0;
	viz[nod]=1;
	
	for(int k=0;k<(int)v[nod].size();++k)
		if(!b[k])
		{
			a[nod]=v[nod][k];
			b[v[nod][k]]=nod;
			return 1;
		}
	for(int k=0;k<(int)v[nod].size();++k)
		if(pairup(b[v[nod][k]]))
		{
			a[nod]=v[nod][k];
			b[v[nod][k]]=nod;
			return 1;
		}
	
	return 0;
}

void solve()
{
	int  ok;
	int nr=0;
	do
	{
		ok=0;
		memset(viz,0,sizeof(viz));
		for(int i=1;i<=n;++i)
			if(!a[i] && pairup(i))
			{
				ok=1;
				++nr;
			}
		
	}while(ok);
	
	fout<<n*2-nr;
}

int main()
{
	read();
	solve();
	
	return 0;
}