Cod sursa(job #3322610)

Utilizator CosminaneBoac Mihai Cosmin Cosminane Data 14 noiembrie 2025 23:02:07
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <fstream>
#include <vector>
using namespace std;
vector <int> v[10005];
int viz[10005], tata[10005], gasit[10005], j;
bool dfs( int x ){
	int i;
	viz[x] = j;
	for( i = 0; i < v[x].size(); i++ ){
		if( tata[v[x][i]] == -1 || ( viz[tata[v[x][i]]] != j && dfs( tata[v[x][i]] ) == 1) ){
			tata[v[x][i]] = x;
			gasit[x] = 1;
			return 1;
		}
	}
	return 0;
}
int main() {
	int n, m, e, i, x, y, r, ok;
	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;
	}
	ok = 1;
	j = 0;
	while( ok == 1 ){
		ok = 0;
        for( i = 1; i <= n; i++ ){
			if( gasit[i] == 0 ){
				ok |= dfs( i );
				j++;
			}
        }
    }
	r = 0;
	for( j = 1; j <= n; j++ ){
		r += gasit[j];
	}
	fout << r << '\n';
	for( i = 1; i <= m; i++ ){
		if( tata[i] != -1 ){
			fout << tata[i] << ' ' << i << '\n';
		}
	}
	return 0;
}