Cod sursa(job #1246480)

Utilizator rzvrzvNicolescu Razvan rzvrzv Data 21 octombrie 2014 09:51:45
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.28 kb
#include<cstdio>
#include<vector>
#include<cstring>

using namespace std;

vector <int> g[100002];
int nr,used[100002],st[100002],dr[100002],i,n,m,e,x,y,ok;

int cupleaza(int nod)
{
    if(used[nod])
    {
        return 0;
    }
    used[nod]=1;
    for(vector<int> :: iterator i=g[nod].begin();i!=g[nod].end();i++)
    {
        if(!dr[*i])
        {
            dr[*i]=nod;
            st[nod]=*i;
            return 1;
        }
        if(cupleaza(dr[*i]))
        {
            dr[*i]=nod;
            st[nod]=*i;
            return 1;
        }
    }
    return 0;
}

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