Cod sursa(job #2122600)

Utilizator alexilasiAlex Ilasi alexilasi Data 5 februarie 2018 12:24:44
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <bits/stdc++.h>

using namespace std;

ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");


int n,m,e,x,y,i,ans;

int viz[10001],st[10001],dr[10001];

bool ok;

vector <int> v1[10001],v2[10001];

bool pair_up(int x)
{
    if(viz[x])return 0;
    viz[x]=1;
    for(auto it:v1[x])
        if(dr[it]==0)
        {
            st[x]=it;
            dr[it]=x;
            return 1;
        }
    for(auto it:v1[x])
        if(pair_up(dr[it]))
        {
            st[x]=it;
            dr[it]=x;
            return 1;
        }
    return 0;
}

int main()
{
    fin>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        fin>>x>>y;
        v1[x].push_back(y);
        v2[y].push_back(x);
    }
    ok=1;
    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(i=1;i<=n;i++)
            if(!st[i])
                ok|=pair_up(i);
    }

    for(i=1;i<=n;i++)
        if(st[i])
    {
        ans++;
        //fout<<i<<" "<<st[i]<<'\n';
    }
    fout<<ans<<'\n';
    for(i=1;i<=n;i++)
        if(st[i])
    {
        fout<<i<<" "<<st[i]<<'\n';
    }
    return 0;
}