Cod sursa(job #2020182)

Utilizator adimiclaus15Miclaus Adrian Stefan adimiclaus15 Data 9 septembrie 2017 15:56:31
Problema Cuplaj maxim in graf bipartit Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.3 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector <int> a[10001];
int n,m,e;
int l[10001],r[10001],viz[10001],sw,nr;
int cuplaj(int x)
{
    int i;
    if(viz[x]==1)
    {
        return 0;
    }
    viz[x]=1;
    for(i=0;i<a[x].size();i++)
    {
        if(r[a[x][i]]==0)
        {
            l[x]=a[x][i];
            r[a[x][i]]=x;
            return 1;
        }
    }
    for(i=0;i<a[x].size();i++)
    {
        if(cuplaj(r[a[x][i]])==1)
        {
            l[x]=a[x][i];
            r[a[x][i]]=x;
            return 1;
        }
    }
    return 0;

}
int main()
{
    int i,x,y;
    f>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    sw=1;
    while(sw==1)
    {
        sw=0;
        for(i=1;i<=n;i++)
        {
            viz[i]=0;
        }
        for(i=1;i<=n;i++)
        {
            if(l[i]==0)
            {
                sw=cuplaj(i);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(l[i]!=0)
        {
            nr++;
        }
    }
    g<<nr<<"\n";
    for(i=1;i<=n;i++)
    {
        if(l[i]!=0)
        {
            g<<i<<" "<<l[i]<<"\n";
        }
    }
    return 0;
}