Cod sursa(job #2722318)

Utilizator AndreiD31Dragan Andrei AndreiD31 Data 12 martie 2021 19:00:16
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>

using namespace std;

ifstream f("cuplaj.in");
ofstream g("cuplaj.out");

int cuplaj(int nod)
{
    if(viz[nod]==1)return 0;
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
    {
        int vecin=v[nod][i];
        if(cuplaj(dr[vecin]) || dr[vecin]==0)
        {
            dr[vecin]=nod;
            st[nod]=vecin;
            return 1;
        }
    }
}

int main()
{
    f>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }

    ok=1;
    while(ok)
    {
        ok=0;
        for(i=1;i<=n;i++)viz[i]=0;
        for(i=1;i<=n;i++)
        {
            if(st[i]==0 && cuplaj(i)==1)
            {
                ok=1;
                sol++;
            }
        }
    }

    g<<sol<<'\n';
    for(i=1;i<=n;i++)
        if(st[i]!=0)g<<i<<" "<<st[i]<<'\n';
    return 0;
}