Cod sursa(job #3268981)

Utilizator BogdanBurescuBogdan Burescu BogdanBurescu Data 18 ianuarie 2025 10:01:57
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.09 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream cin ("cuplaj.in");
ofstream cout ("cuplaj.out");

int n,m,e,x,y;
vector<int>graf[10005];
vector<int>used;
vector<int>mt;
vector<int>l;

bool try_kuhn(int v)
{
    if(used[v])
        return false;
    used[v]=true;
    for(int to:graf[v])
        if(mt[to]==-1 || try_kuhn(mt[to]))
        {
            mt[to]=v;
            l[v]=to;
            return true;
        }
    return false;
}

int main()
{
    cin>>n>>m>>e;
    for(int i=1;i<=e;i++)
    {
        cin>>x>>y;
        graf[x].push_back(y);
    }
    l.assign(n+5,-1);
    used.assign(n+5,false);
    mt.assign(m+5,-1);
    int change=1;
    while(change)
    {
        change=0;
        used.assign(n+5,false);
        for(int v=0;v<n;v++)
        {
            if(l[v]==-1)
                change|=try_kuhn(v);
        }
    }
    int ans=0;
    for(int i=0;i<m;i++)
        if(mt[i]>0)
        ans++;
    cout<<ans<<'\n';
    for(int i=0;i<m;i++)
        if(mt[i]>0)
        cout<<i<<' '<<l[i]<<'\n';
    return 0;
}