Cod sursa(job #1151832)

Utilizator ovidiu95Decean Ovidiu Ciprian ovidiu95 Data 24 martie 2014 13:14:22
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include<cstdio>
#include<cstring>
#include<vector>
#define NMAX 10010
using namespace std;
int cup[NMAX],viz[NMAX],i,m,n,u,x,y,sol;
vector<int> v[NMAX];
int cupleaza(int i)
{
    if(viz[i]) return 0;
    viz[i]=1;
    for(vector<int>::iterator it=v[i].begin();it!=v[i].end();++it)
    {
        if(!cup[*it]||(cup[*it]!=i && cupleaza(cup[*it])))
        {
            cup[*it]=i;
            return 1;
        }
    }
    return 0;
}

int main()
{
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);
    scanf("%d%d%d",&n,&m,&u);
    for(;u;--u)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=1;i<=n;++i)
    {
        memset(viz,0,sizeof(viz));
        sol+=cupleaza(i);
    }
    printf("%d\n",sol);
    for(i=1;i<=m;++i)
        if(cup[i]) printf("%d %d\n",cup[i],i);
    return 0;
}