Cod sursa(job #2279934)

Utilizator PredescuSebastianIonPredescu Sebastian Ion PredescuSebastianIon Data 10 noiembrie 2018 10:28:13
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.15 kb
#include <fstream>
#include <vector>
#define MAX 10010

using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,k,x,y,sol,l[MAX],r[MAX];
vector<int> v[MAX];
bool test,a[MAX];
bool cupleaza(int nod)
{
    if(a[nod])return 0;
    a[nod]=true;
    for(auto i:v[nod])
    {
        if(r[i]==0)
        {
            l[nod]=i;
            r[i]=nod;
            return 1;
        }
    }
    for(auto i:v[nod])
    {
        if(cupleaza(r[i]))
        {
            l[nod]=i;
            r[i]=nod;
            return 1;
        }
    }
    return 0;
}

int main()
{
    f>>n>>m>>k;
    for(int i=1; i<=k; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    test=true;
    while(test)
    {
        test=false;
        for(int i=1; i<=max(n,m); i++)
        {
            a[i]=false;
        }
        for(int i=1; i<=n; i++)
        {
            if(l[i]==0 && cupleaza(i))test=true;
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(l[i]!=0)sol++;
    }
    g<<sol<<'\n';
    for(int i=1;i<=n;i++)
    {
        if(l[i]!=0)g<<i<<" "<<l[i]<<'\n';
    }
    return 0;
}