Cod sursa(job #1922862)

Utilizator Vlad1111Sbengheci Vlad-Andrei Vlad1111 Data 10 martie 2017 19:19:57
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.23 kb
#include <iostream>
#include <cstdio>
#include <vector>
#define cout cerr
#define MAX 10010
using namespace std;

int m,n,e,x,y,OK;
vector <int> L[MAX];
int st[MAX],dr[MAX],viz[MAX];

int stiva(int k)
{
    if(viz[k])
        return 0;
    viz[k]=1;
    int l;
    for(int i=0; i<L[k].size(); i++)
    {
        l=L[k][i];
        if(dr[l]==0 || stiva(dr[l]))
        {
            dr[l]=k;
            st[k]=l;
            return 1;
        }
    }
    return 0;
}

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

    scanf("%d %d %d",&n,&m,&e);

    for(int i=1; i<=e; i++)
    {
        scanf("%d %d",&x,&y);
        L[x].push_back(y);
    }
    OK=1;

    int nr=0;
    while(OK)
    {
        for(int i=1; i<=n; i++)
            viz[i]=0;
        OK=0;
        nr=0;
        for(int i=1; i<=n; i++)
            {
                if(st[i]==0 && stiva(i))
                {
                    stiva(i);
                    OK=1;
                }
                if(st[i]!=0)
                    nr++;
            }
    }
    printf("%d\n",nr);
    for(int i=1;i<=n;i++)
        if(st[i]!=0)
            printf("%d %d\n",i,st[i]);
    return 0;
}