Cod sursa(job #1637476)

Utilizator TibixbAndrei Tiberiu Tibixb Data 7 martie 2016 17:34:37
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.25 kb
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
vector<int> G[10005];
bool u[10005];
int n, m, nrm, i, x, y, ncup, R[10005], L[10005], ok;
int cuplaj(int nod)
{
    if(u[nod]==1)
        return 0;
    u[nod]=1;
    int vecin=0, i=0;
    for(i=0; i<G[nod].size(); i++)
    {
        vecin=G[nod][i];
        if(L[vecin]==0)
        {
            R[nod]=vecin;
            L[vecin]=nod;
            return 1;
        }
    }
    for(i=0; i<G[nod].size(); i++)
    {
        vecin=G[nod][i];
        if(cuplaj(L[vecin]))
        {
            R[nod]=vecin;
            L[vecin]=nod;
            return 1;
        }
    }
    return 0;
}
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
int main()
{
    in>>n>>m>>nrm;
    for(;nrm--;)
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    //ok=1;
    do
    {
        ok=0;
        memset(u, 0, sizeof(u));
        for(i=1; i<=n; i++)
        {
            if(R[i]==0)
                ok|=cuplaj(i);
        }
    }
    while(ok);
    for(i=1; i<=n; i++)
        if(R[i]!=0)
            ncup++;
    out<<ncup<<"\n";
    for(i=1; i<=n; i++)
    {
        if(R[i]!=0)
            out<<i<<" "<<R[i]<<"\n";
    }
    return 0;
}