Cod sursa(job #1474590)

Utilizator Vlad_lsc2008Lungu Vlad Vlad_lsc2008 Data 22 august 2015 13:25:34
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.29 kb
#include <cstdio>
#include <vector>
#define Nmax 10005
using namespace std;

vector <int> M[Nmax];

int st[Nmax],dr[Nmax],u[Nmax];
int n,m,muchii;

int pair_nod(int poz)
{
    int i;
    if(u[poz]) return 0;
    u[poz]=1;
    for(i=0;i<M[poz].size();i++)
        if(!dr[i])
        {
            st[poz]=i;
            dr[i]=poz;
            return 1;
        }
    for(i=0;i<M[poz].size();i++)
        if(pair_nod(dr[i]))
        {
            st[poz]=i;
            dr[i]=poz;
            return 1;
        }
    return 0;
}

int main()
{
    int x,y,i,j;
    freopen("cuplaj.in","r",stdin);
    freopen("cuplaj.out","w",stdout);

    scanf("%d%d%d",&n,&m,&muchii);
    for(;muchii;muchii--)
    {
        scanf("%d%d",&x,&y);
        M[x].push_back(y);
    }

    int change=1;
    while(change)
    {
       change=0;
       for(i=1;i<=n;i++)
        {
            for(j=1;j<=n;j++) printf("%d ",st[j]); printf("\n");
            for(j=1;j<=n;j++) printf("%d ",dr[j]); printf("\n\n");
            if(!st[i]) change|=pair_nod(i);
        }
    }

    /*int cupluri=0;
    for(i=1;i<=n;i++) if(st[i]>0) cupluri+=1; printf("%d\n",cupluri);
    for(i=1;i<=n;i++) if(st[i]>0) printf("%d %d\n",i,st[i]);*/
    fclose(stdin);
    fclose(stdout);
    return 0;
}