Cod sursa(job #1153354)

Utilizator ThomasFMI Suditu Thomas Thomas Data 25 martie 2014 13:36:32
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <fstream>
#include <vector>
using namespace std;

#define NMax 10005

ifstream f("cuplaj.in");
ofstream g("cuplaj.out");

int n,m,e;
vector<int> v[NMax];
int viz[NMax],l[NMax],r[NMax];

int pairup(int s)
{
    if(viz[s]) return 0;

    int i;
    viz[s]=1;
    for(i=0;i<(int)v[s].size();i++) if(!r[v[s][i]])
    {
        l[s]=v[s][i];
        r[v[s][i]]=s;
        return 1;
    }
    for(i=0;i<(int)v[s].size();i++) if(pairup(r[v[s][i]]))
    {
        l[s]=v[s][i];
        r[v[s][i]]=s;
        return 1;
    }
    return 0;
}

int main()
{
    int i,a,b,nm;

    f>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        f>>a>>b;
        v[a].push_back(b);
    }

    if(n>m) nm=n; else nm=m;

    int change=1;
    while(change)
    {
        change=0;
        for(i=0;i<=nm;i++) viz[i]=0;
        for(i=1;i<=n;i++) if(!l[i]) change|=pairup(i);
    }

    int cuplaj=0;
    for(i=1;i<=n;i++) if(l[i]>0) cuplaj++;
    g<<cuplaj<<"\n";
    for(i=1;i<=n;i++) if(l[i]>0) g<<i<<" "<<l[i]<<"\n";

    f.close();
    g.close();
    return 0;
}