Cod sursa(job #1499256)

Utilizator TibixbAndrei Tiberiu Tibixb Data 10 octombrie 2015 13:42:07
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.24 kb
#include<fstream>
#include<bitset>
#include<vector>
using  namespace std;
bitset<10003> u;
vector <int> v[10003];
int T, 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("java.in");
ofstream out("java.out");
int main()
{
    in>>T;
    while(T!=0)
    {
        in>>m>>n>>nrm;
        for(i=1; i<=nrm; i++)
        {
            in>>x>>y;
            v[x].push_back(y);
        }
        do
        {
            u.reset();
            ok=0;
            for(i=1; i<=m; i++)
            {
                if(L[i]==0)
                    ok|=cupleaza(i);
            }
        }
        while(ok==1);
        sol=0;
        for(i=1; i<=m; i++)
            if(L[i]!=0)
                sol++;
        out<<sol<<"\n";
        T--;
    }
}