Cod sursa(job #2122606)

Utilizator DavidDragulinDragulin David DavidDragulin Data 5 februarie 2018 12:31:57
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.05 kb
#include <bits/stdc++.h>

using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int st[10009],dr[10009],viz[10009],n,m,e,i,x,y,ok;
vector <int> v[10009];
int build(int x)
{
    if(viz[x])
        return 0;
    viz[x]=1;
    for(auto it:v[x])
    {
        if(dr[it]==0)
        {
            st[x]=it;
            dr[it]=x;
            return 1;
        }
    }
    for(auto it:v[x])
    {
        if(build(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;
        v[x].push_back(y);
    }
    ok=1;
    while(ok)
    {
        ok=0;
        memset(viz,0,sizeof(viz));
        for(i=1;i<=n;i++)
            if(!st[i])
                ok|=build(i);
    }
    int nr=0;
    for(i=1;i<=n;i++)
        if(st[i]!=0)
            nr++;
    fout<<nr<<'\n';
    for(i=1;i<=n;i++)
        if(st[i]!=0)
            fout<<i<<" "<<st[i]<<'\n';
    return 0;
}