Cod sursa(job #1646942)

Utilizator lupvasileLup Vasile lupvasile Data 10 martie 2016 18:18:31
Problema Cuplaj maxim in graf bipartit Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <bits/stdc++.h>
using namespace std;
#ifdef INFOARENA
#define cout fout
#endif // INFOARENA
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
/// ////////////////////////////////

void read();

#define nmax 10010

int R[nmax],L[nmax],n,m;
vector<int> G[nmax];

bool cupleaza(int nod)
{
    for(auto vec:G[nod])
        if(!L[vec])
    {
        L[R[nod]]=0;
        R[nod]=vec;
        L[vec]=nod;
        return 1;
    }

    for(auto vec:G[nod])
        if(L[vec]!=nod && cupleaza(L[vec]))
        {
            L[R[nod]]=0;
            R[nod]=vec;
            L[vec]=nod;
            return 1;
        }

    return 0;
}

int main()
{
    int i,nr(0);
    read();
    for(i=1;i<=n;++i)
        if(!R[i]) cupleaza(i);

    for(i=1;i<=n;++i) nr+=(R[i]>0);
    cout<<nr<<'\n';
    for(i=1;i<=n;++i)
        if(R[i]) cout<<i<<' '<<R[i]<<'\n';
    return 0;
}

void read()
{
    int k,x,y;
    fin>>n>>m>>k;
    for(;k;--k)
    {
        fin>>x>>y;
        G[x].push_back(y);
    }
}