Cod sursa(job #3147193)

Utilizator aaagabiTurbinca Gabriel aaagabi Data 24 august 2023 17:53:10
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.99 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
typedef long long ll;
int viz[10005],cuplat[10005],p[10005];
vector <int> v[10005];
int l,r,m,x,y,nr;
bool dfs(int nod)
{
    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
        if(p[v[nod][i]]==0||(viz[p[v[nod][i]]]==0&&dfs(p[v[nod][i]])==1))
    {
        p[v[nod][i]]=nod;
        cuplat[nod]=1;
        return 1;
    }
    return 0;
}
void cuplaj()
{
    bool ok=1;
    while(ok)
    {
        ok=0;
        for(int i=1;i<=l;i++)
            viz[i]=0;
        for(int i=1;i<=l;i++)
            if(cuplat[i]==0&&dfs(i)==1)
        {
            nr++;
            ok=1;
        }
    }
}

int main()
{
    fin>>l>>r>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    cuplaj();
    fout<<nr<<'\n';
    for(int i=1;i<=r;i++)
        if(p[i]!=0)
    {
        fout<<p[i]<<' '<<i<<'\n';
    }
    return 0;
}