Cod sursa(job #2588969)

Utilizator dr_personalityEftime Andrei Horatiu dr_personality Data 25 martie 2020 16:59:15
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.18 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
 
const int nmax = 10005;
int n, m, e, cuplajst[nmax], cuplajdr[nmax], rasp;
vector <int> vecini[nmax];
bool poz[nmax], ver;

bool cuplaj(int x)
{
	if(poz[x]==1)
		return 0;
	poz[x] = 1;

	for(int i = 0; i<(int)vecini[x].size(); i++)
	{
		if(cuplajst[vecini[x][i]]==0)
		{
			cuplajst[vecini[x][i]] = x;
			cuplajdr[x] = vecini[x][i];

			return 1;
		}
	}

	for(int i = 0; i<(int)vecini[x].size(); i++)
	{
		if(cuplaj(cuplajst[vecini[x][i]])==1)
		{
			cuplajst[vecini[x][i]] = x;
			cuplajdr[x] = vecini[x][i];

			return 1;
		}
	}

	return 0;
}

int main()
{
    in>>n>>m>>e;
	for(int i = 0; i<e; i++)
	{
		int a, b;
		in>>a>>b;
		vecini[a].push_back(b);
	}

	while(ver==0)
	{
		ver = 1;
		for(int i = 1; i<=n; i++)
		{
			if(cuplajdr[i]==0 && cuplaj(i)==1)
				ver = 0;
		}

		for(int i = 1; i<=n; i++)
			poz[i] = 0;
	}

	for(int i = 1; i<=n; i++)
	{
		if(cuplajdr[i]!=0)
			rasp++;
	}

	out<<rasp<<'\n';
	for(int i = 1; i<=n; i++)
	{
		if(cuplajdr[i]!=0)
		{
			out<<i<<' '<<cuplajdr[i]<<'\n';
		}
	}

    return 0;
}