Cod sursa(job #2523518)

Utilizator alexdumitrescuDumitrescu George Alex alexdumitrescu Data 14 ianuarie 2020 11:58:44
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <bits/stdc++.h>
#define Nmax 10005

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


vector <int> v[Nmax];
int n, m, e, l[Nmax], r[Nmax], viz[Nmax], x, y, cuplaj;
int pereche(int x)
{
    if(viz[x])
        return 0;
    viz[x]=1;
    for(auto it : v[x])
        if(!r[it])
        {
            l[x]=it;
            r[it]=x;
            return 1;
        }
    for(auto it : v[x]) if(pereche(r[it]))
        {
            l[x]=it;
            r[it]=x;
            return 1;
        }
    return 0;
}
int main()
{
    fin >> n >> m >> e;
    for(int i=1;i<=e;i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    bool ok=1;
    while(ok)
    {
        ok=0;
        memset(viz, 0, sizeof(viz));
        for(int i=1;i<=n;i++)
            if(!l[i])
                ok|=pereche(i);
    }
    for(int i=1;i<=n;i++)
        if(l[i])
            cuplaj++;
    fout << cuplaj << '\n';
    for(int i=1;i<=n;i++)
        if(l[i])
            fout << i << ' ' << l[i] << '\n';

    return 0;
}