Cod sursa(job #2738797)

Utilizator AndreiD31Dragan Andrei AndreiD31 Data 6 aprilie 2021 12:57:23
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.02 kb
#include <bits/stdc++.h>

using namespace std;

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

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

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

int n,m,e,i,ok,x,sol,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)
    {
        for(i=1;i<=n;i++)viz[i]=0;
        ok=0;

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

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