Cod sursa(job #3240664)

Utilizator CosminaneBoac Mihai Cosmin Cosminane Data 19 august 2024 14:40:54
Problema Cuplaj maxim in graf bipartit Scor 70
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <vector>
using namespace std;
vector <int> v[10005];
int viz[10005], tata[10005];
bool dfs(int x) {
	int i;
	viz[x] = 1;
	for (i = 0; i < v[x].size(); i++) {
		if (tata[v[x][i]] == -1 || (viz[tata[v[x][i]]] == 0 && dfs(tata[v[x][i]]) == 1)) {
			tata[v[x][i]] = x;
			return 1;
		}
	}
	return 0;
}
int main() {
	int n, m, e, i, j, x, y, r;
	ifstream fin( "cuplaj.in" );
	ofstream fout( "cuplaj.out" );
	fin >> n >> m >> e;
	for (i = 0; i < e; i++) {
		fin >> x >> y;
		v[x].push_back( y );
	}
	for (i = 1; i <= m; i++) {
		tata[i] = -1;
	}
	r = 0;
	for (i = 1; i <= n; i++) {
		for (j = 1; j <= m; j++) {
			viz[j] = 0;
		}
		r += dfs( i );
	}
	fout << r << '\n';
	for (i = 1; i <= m; i++) {
		if (tata[i] != -1) {
			fout << tata[i] << ' ' << i << '\n';
		}
	}
	return 0;
}