Cod sursa(job #2627609)

Utilizator betybety bety bety Data 11 iunie 2020 15:01:54
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out");
vector<int> vec[10005];
int l[10005],r[10005];
bool ok[10005];
bool path(int nod)
{
    if(ok[nod])
        return false;
    ok[nod]=true;
    for(int x:vec[nod])
    if(!l[x] or path(l[x]))
    {
        r[nod]=x;
        l[x]=nod;
        return true;
    }
    return false;
}
int main()
{
    int n,m,e,a,b;
    cin>>n>>m>>e;
    for(int i=1;i<=e;++i)
    {
        cin>>a>>b;
        vec[a].push_back(b);
    }
    bool modif;
    int cuplaj=0;
    do
    {
        for(int i=1;i<=n;++i)
            ok[i]=false;
        modif=false;
        for(int i=1;i<=n;++i)
        if(!r[i] and path(i))
        {
            ++cuplaj;
            modif=true;
        }
    }while(modif);
    cout<<cuplaj<<'\n';
    for(int i=1;i<=n;++i)
    if(r[i]) cout<<i<<' '<<r[i]<<'\n';
    return 0;
}