Cod sursa(job #1438942)

Utilizator sanzianaioneteIonete Sanziana sanzianaionete Data 21 mai 2015 10:19:09
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.2 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,e,L[100005],R[100005],nr=0;
vector<int> a[100005];
bool viz[100005];
bool pairup(int nod)
{
    if(viz[nod])
        return 0;
    viz[nod]=1;
    int l=a[nod].size();
    for(int i=0;i<l;i++)
    {
        if(!R[a[nod][i]])
        {
            L[nod]=a[nod][i];
            R[a[nod][i]]=nod;
            return 1;
        }
    }
    for(int i=0;i<l;i++)
        if(pairup(R[a[nod][i]]))
        {
            L[nod]=a[nod][i];
            R[a[nod][i]]=nod;
            return 1;
        }
    return 0;
}
int main()
{
    f>>n>>m>>e;
    for(int i=0;i<e;i++)
    {
        int x,y;
        f>>x>>y;
        a[x].push_back(y);
    }
    bool ok=1;
    while(ok)
    {
        ok=0;
        for(int i=1;i<=n;i++)
            viz[i]=0;
        for(int i=1;i<=n;i++)
            if(!L[i])
                if(pairup(i))
                    ok=1;
    }
    for(int i=1;i<=n;i++)
        if(L[i])
            nr++;
    g<<nr<<"\n";
    for(int i=1;i<=n;i++)
        if(L[i])
            g<<i<<' '<<L[i]<<"\n";
    f.close();g.close();
    return 0;
}