Cod sursa(job #2971864)

Utilizator raileanu-alin-gabrielRaileanu Alin-Gabriel raileanu-alin-gabriel Data 28 ianuarie 2023 11:01:24
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.02 kb
#include <fstream>
#include <vector>
const int NMAX=10005;

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");

vector <int> v[NMAX];
int p[NMAX];
bool f[NMAX], cplt[NMAX];
int l, r, m, nr;

bool dfs(int);

int main()
{
    bool ok=true;
    int i, a, b;
    fin>>l>>r>>m;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b;
        v[a].push_back(b);
    }

    while(ok)
    {
        ok=false;
        for(i=1; i<=l; i++) f[i]=false;
        for(i=1; i<=l; i++)
        {
            if(cplt[i]==false && dfs(i))
            {
                nr++;
                ok=true;
            }
        }
    }

    fout<<nr<<'\n';
    for(i=1; i<=r; i++)
    {
        if(p[i]) fout<<p[i]<<' '<<i<<'\n';
    }
    return 0;
}

bool dfs(int nod)
{
    f[nod]=true;
    for(auto i:v[nod])
    {
        if(!p[i] || (!f[p[i]] && dfs(p[i])))
        {
            p[i]=nod;
            cplt[nod]=true;
            return true;
        }
    }
    return false;
}