Cod sursa(job #2262553)

Utilizator cezarzbughinCezar Zbughin cezarzbughin Data 17 octombrie 2018 16:42:57
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.12 kb
#include <bits/stdc++.h>

using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
const int N = 10010;
vector<int> v[N];
bitset<N> viz;
int st[N],dr[N];
int n,m,e,x,y;
bool cuplez(int);
int main()
{
    f>>n>>m>>e;
    for(; m; m--)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    bool ok=true;
    int cuplari=0;
    while(ok)
    {
        ok=false;
        viz.reset();
        for(int i=1; i<=n; i++)
            if(!dr[i])
                if(cuplez(i))
                {
                    ok=true;
                    cuplari++;
                }
    }
    g<<cuplari<<'\n';
    for(int i=1;i<=n;i++)
        if(dr[i])
            g<<i<<' '<<dr[i]<<'\n';
    return 0;
}
bool cuplez(int nod)
{
    if(viz[nod])return false;
    viz[nod]=1;
    for(auto vec:v[nod])
        if(!st[vec])
        {
            dr[nod]=vec;
            st[vec]=nod;
            return true;
        }
    for(auto vec:v[nod])
        if(cuplez(dr[vec]))
        {
            st[nod]=vec;
            dr[vec]=nod;
            return true;
        }
    return false;
}