Cod sursa(job #2260545)

Utilizator YouDontNeedMyNameJurcut Paul YouDontNeedMyName Data 15 octombrie 2018 09:37:39
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.26 kb
#include <bits/stdc++.h>

using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
int n,m,e,v[10005],r[10005],l[10005];
vector <int> lista[10005];
bool cuplaj(int node)
{
    if(v[node])
        return 0;
    v[node]=1;
    for(int i=0; i<lista[node].size(); i++)
    {
        if(!l[lista[node][i]])
        {
            r[node]=lista[node][i];
            l[lista[node][i]]=node;
            return 1;
        }
    }
    for(int i=0; i<lista[node].size(); i++)
    {
        if(cuplaj(l[lista[node][i]]))
        {
            r[node]=lista[node][i];
            l[lista[node][i]]=node;
            return 1;
        }
    }
    return 0;
}
int main()
{
    in >> n >> m >> e;
    for(int i=1; i<=e; i++)
    {
        int a,b;
        in >> a >> b;
        lista[a].push_back(b);
    }
    int ok=1;
    while(ok)
    {
        ok=0;
        for(int i=1; i<=n; i++)
        {
            if(!r[i]) ok|=cuplaj(i);
        }
        memset(v,0,sizeof(v));
    }
    int nr=0;
    for(int i=1; i<=n; i++)
    {
        if(r[i]) nr++;
    }
    out << nr << '\n';
    for(int i=1; i<=n; i++)
    {
        if(r[i])
        {
            out << i << ' ' << r[i] << '\n';
        }
    }
    return 0;
}