Cod sursa(job #1919846)

Utilizator george_stelianChichirim George george_stelian Data 9 martie 2017 21:17:51
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <cstdio>
#include <vector>
#include <bitset>

using namespace std;

vector<int> g[10010];
bitset<10010> vaz;
int cup1[10010],cup2[10010];

int cupleaza(int nod)
{
    if(vaz[nod]) return 0;
    vaz[nod]=1;
    for(vector<int>::iterator it=g[nod].begin();it!=g[nod].end();it++)
        if(!cup2[*it] || cupleaza(cup2[*it]))
        {
            cup1[nod]=*it;
            cup2[*it]=nod;
            return 1;
        }
    return 0;
}

int main()
{
    freopen("file.in", "r", stdin);
    freopen("file.out", "w", stdout);
    int n,m,e,x,y,nr=0;
    scanf("%d%d%d",&n,&m,&e);
    for(int i=1;i<=e;i++)
    {
        scanf("%d%d",&x,&y);
        g[x].push_back(y);
    }
    int ok=1;
    while(ok)
    {
        ok=0;
        vaz.reset();
        for(int i=1;i<=n;i++)
            if(!cup1[i]) ok|=cupleaza(i);
    }
    for(int i=1;i<=n;i++)
        if(cup1[i]) nr++;
    printf("%d\n",nr);
    for(int i=1;i<=n;i++)
        if(cup1[i]) printf("%d %d\n",i,cup1[i]);
    return 0;
}