Cod sursa(job #2848078)

Utilizator VladMxPMihaila Vlad VladMxP Data 12 februarie 2022 09:46:32
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n,m,st[10001],dr[10001];
vector<int> v[10001];
bool viz[10001];

int pairup(int nod)
{
    if(viz[nod])
        return 0;
    viz[nod]=1;
    for(auto vec : v[nod])
    {
        if(!st[vec]||pairup(st[vec]))
        {
            st[vec]=nod;
            dr[nod]=vec;
            return 1;
        }
    }
    return 0;
}

int main()
{
    int e,x,y,ok=1,nr=0;
    fin>>n>>m>>e;
    for(;e;e--)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(int i=1;i<=n;i++)
            if(!dr[i]&&pairup(i))
                ok=1;
    }
    for(int i=1;i<=n;i++)
        if(dr[i])nr++;
    fout<<nr<<'\n';
    for(int i=1;i<=n;i++)
    {
        if(dr[i])
            fout<<i<<" "<<dr[i]<<'\n';
    }
}