Cod sursa(job #2695405)

Utilizator @stefansevastre@Stefan Sevastre @stefansevastre@ Data 12 ianuarie 2021 21:09:49
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <bits/stdc++.h>

using namespace std;

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

vector <int> v[10100];
int dr[10100],st[10100],viz[10100];

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(dr[vecin]==0 || cuplaj(dr[vecin]))
        {
            dr[vecin]=nod;
            st[nod]=vecin;
            return 1;
        }
    }
    return 0;
}

int n,m,ok,e,i,sol,x,y;
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;
}