Cod sursa(job #1499238)

Utilizator TibixbAndrei Tiberiu Tibixb Data 10 octombrie 2015 13:22:46
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.18 kb
#include<fstream>
#include<vector>
#include<bitset>
using namespace std;
bitset<10003> u;
vector <int> v[10003];
int n, m, nrm, i, x, y, ok, L[10003], R[10003], sol;
int cupleaza (int nod)
{
    if(u[nod]==1)
        return 0;
    u[nod]=1;
    for(int i=0; i<v[nod].size(); i++)
    {
        if(R[v[nod][i]]==0)
        {
            L[nod]=v[nod][i];
            R[v[nod][i]]=nod;
            return 1;
        }
    }
    for(int i=0; i<v[nod].size(); i++)
    {
        if(cupleaza(R[v[nod][i]]))
        {
            L[nod]=v[nod][i];
            R[v[nod][i]]=nod;
            return 1;
        }
    }
    return 0;
}
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
int main()
{
    in>>n>>m>>nrm;
    for(i=1; i<=nrm; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    do
    {
        u.reset();
        ok=0;
        for(i=1; i<=n; i++)
        {
            if(L[i]==0)
                ok|=cupleaza(i);
        }
    }
    while(ok==1);
    for(i=1; i<=n; i++)
        if(L[i]!=0)
            sol++;
    out<<sol<<"\n";
    for(i=1; i<=n; i++)
        if(L[i]!=0)
            out<<i<<" "<<L[i]<<"\n";
    return 0;
}