Cod sursa(job #2848112)

Utilizator darisavuSavu Daria darisavu Data 12 februarie 2022 10:08:30
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.86 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector<int>v[10005];
int n,m,k,x,y,i,ok=1,nr,viz[10005],st[10005],dr[10005];
int potcupla(int nod)
{
    if(viz[nod]) return 0;
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
    {
        int vec=v[nod][i];
        if(!dr[vec]|| potcupla(dr[vec]))
        {
            dr[vec]=nod;
            st[nod]=vec;
            return 1;
        }
    }
    return 0;
}
int main()
{
    f>>n>>m>>k;
    for(i=1;i<=k;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(i=1;i<=n;i++) if(!st[i]&&potcupla(i)) ok=1;

    }
    for(i=1;i<=n;i++) if(st[i]) nr++;
    g<<nr<<'\n';
     for(i=1;i<=n;i++) if(st[i]) g<<i<<" "<<st[i]<<'\n';


    return 0;
}