Cod sursa(job #1615693)

Utilizator TibixbAndrei Tiberiu Tibixb Data 26 februarie 2016 19:27:33
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
vector<int> v[10005];
bool u[10005];
int n, m, nrm, x, y, i, ok, R[10005], L[10005], sol;
int cupleaza(int nod)
{
    if(u[nod]==1)
        return 0;
    u[nod]=1;
    for(int i=0; i<v[nod].size(); i++)
    {
        if(L[v[nod][i]]==0)
        {
            R[nod]=v[nod][i];
            L[v[nod][i]]=nod;
            return 1;
        }
    }
    for(int i=0; i<v[nod].size(); i++)
    {
        if(cupleaza(L[v[nod][i]]))
        {
            R[nod]=v[nod][i];
            L[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
    {
        ok=0;
        memset(u, 0, sizeof(u));
        for(i=1; i<=n; i++)
        {
            if(R[i]==0)
            {
                ok|=cupleaza(i);
            }
        }
    }
    while(ok==1);
    for(i=1; i<=n; i++)
    {
        if(R[i]!=0)
            sol++;
    }
    out<<sol<<"\n";
    for(i=1; i<=n; i++)
        if(R[i]!=0)
            out<<i<<" "<<R[i]<<"\n";
    return 0;
}