Cod sursa(job #3330006)

Utilizator Radu_BicliBiclineru Radu Radu_Bicli Data 16 decembrie 2025 22:47:05
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.38 kb
#include <bits/stdc++.h>

using namespace std;

#define USE_STD_IO 0
//#define if(USE_STD_IO) cout
#if USE_STD_IO
    #define fin cin
    #define fout cout
#else
    ifstream fin("cuplaj.in");
    ofstream fout("cuplaj.out");
#endif // USE_STD_IO

int n, m, q, i, rasp;
vector<int> gr[10002];

bool viz[10002], ok;
int cup[2][10002];

static inline bool Cupleaza(int nod) {
    if(viz[nod]) return false;
    viz[nod] = true;
    for(int vec : gr[nod]) {
        if(cup[1][vec] == 0) {
            cup[1][vec] = nod;
            cup[0][nod] = vec;
            return true;
        }
    }
    for(int vec : gr[nod]) {
        if(Cupleaza(cup[1][vec])) {
            cup[1][vec] = nod;
            cup[0][nod] = vec;
            return true;
        }
    }

    return false;
}

int main() {
    fin.tie(nullptr);
    fout.tie(nullptr);

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

    do {
        ok = false;
        memset(viz, 0, sizeof(viz));
        for(i = 1; i <= n; i++) {
            if(cup[0][i] == 0) ok |= Cupleaza(i);
        }
    }
    while(ok);

    for(i = 1; i <= n; i++) rasp += (cup[0][i] != 0);
    fout << rasp << "\n";
    for(i = 1; i <= m; i++) {
        if(cup[1][i] != 0) fout << cup[1][i] << " " << i << "\n";
    }

    return 0;
}