Cod sursa(job #1690819)

Utilizator TibixbAndrei Tiberiu Tibixb Data 15 aprilie 2016 21:23:45
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.24 kb
#include<fstream>
#include<vector>
#include<cstring>
using namespace std;
vector<int> G[10005];
bool u[10005], ok;
int n, m, k, x, y, R[10005], L[10005], nrcup, i;
int cupleaza(int nod)
{
    if(u[nod]==1)
        return 0;
    u[nod]=1;
    int vecin, i;
    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(cupleaza(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>>k;
    for(i=1; i<=k; i++)
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    do
    {
        memset(u, 0, sizeof(u));
        ok=0;
        for(i=1; i<=n; i++)
        {
            if(R[i]==0)
                ok|=cupleaza(i);
        }
    }
    while(ok);
    for(i=1; i<=n; i++)
        if(R[i]!=0)
            nrcup++;
    out<<nrcup<<"\n";
    for(i=1; i<=n; i++)
    {
        if(R[i]!=0)
            out<<i<<" "<<R[i]<<"\n";
    }
    return 0;
}