Cod sursa(job #1728731)

Utilizator ValentinSavoiuFMI Savoiu Valentin-Marian ValentinSavoiu Data 13 iulie 2016 16:21:41
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,e,x,y,ok,etc,i,cup[10001],nr,cups[10001],viz[10001];
vector <int> G[10001];
bool cupl(int nod)
{
    if(viz[nod]) return 0;
    int i,v;
    viz[nod]=1;
    for(i=0;i<G[nod].size();i++)
    {
        v=G[nod][i];
        if(!cups[v]||cupl(cups[v]))
        {
            cup[nod]=v;
            cups[v]=nod;
            return 1;
        }
    }
    return 0;
}
int main()
{
    f>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    do
    {
        ok=0;
        for(i=1;i<=n;i++) viz[i]=0;
        for(i=1;i<=n;i++)
            if(!cup[i]) ok=(cupl(i)||ok);
    }while (ok);
    for(i=1;i<=n;i++) if(cup[i]) nr++;
    g<<nr<<'\n';
    for(i=1;i<=n;i++)
        if(cup[i]) g<<i<<' '<<cup[i]<<'\n';

    return 0;
}