Cod sursa(job #2705683)

Utilizator hhhhhhhAndrei Boaca hhhhhhh Data 13 februarie 2021 09:55:40
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.14 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n,m,e,l[20001],r[20001];
vector<int> muchii[20001];
bool use[20001];
bool pairup(int nod)
{
    if(use[nod]==1)
        return 0;
    use[nod]=1;
    for(auto i:muchii[nod])
        if(!r[i])
        {
            r[i]=nod;
            l[nod]=i;
            return 1;
        }
    for(auto i:muchii[nod])
        if(pairup(r[i]))
        {
            r[i]=nod;
            l[nod]=i;
            return 1;
        }
    return 0;
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin>>n>>m>>e;
    for(int i=1;i<=e;i++)
    {
        int a,b;
        fin>>a>>b;
        muchii[a].push_back(b);
    }
    bool ok=1;
    while(ok)
    {
        ok=0;
        memset(use,0,sizeof(use));
        for(int i=1;i<=n;i++)
            if(!l[i])
                if(pairup(i))
                    ok=1;
    }
    int ans=0;
    for(int i=1;i<=n;i++)
        if(l[i])
            ans++;
    fout<<ans<<'\n';
    for(int i=1;i<=n;i++)
        if(l[i])
            fout<<i<<" "<<l[i]<<'\n';
    return 0;
}