Cod sursa(job #2566254)

Utilizator AndreiDeltaBalanici Andrei Daniel AndreiDelta Data 2 martie 2020 20:03:17
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.31 kb
#include <bits/stdc++.h>
#define Dim 10001
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int L,R,M,LtoR[Dim],RtoL[Dim],a,b,ans;
bool viz[Dim];

vector < int > V[Dim];

bool Hopcroft(int nod)
{
    if( viz[nod] ) return false;
    viz[nod]=1;

    for(unsigned int i=0;i<V[nod].size();i++)
    {
        int vecin=V[nod][i];
        if( RtoL[vecin] == 0 )
        {
            LtoR[nod]=vecin;
            RtoL[vecin]=nod;
            return true;
        }
    }

    for(unsigned int i=0;i<V[nod].size();i++)
    {
        int vecin=V[nod][i];
        if( Hopcroft( RtoL[vecin] ) )
        {
            LtoR[nod]=vecin;
            RtoL[vecin]=nod;
            return true;
        }
    }
    return false;
}

int main()
{
    f>>L>>R>>M;
    for(int i=1;i<=M;i++)
    {
        f>>a>>b;
        V[a].push_back(b);
    }

    bool stop=0;

    while(!stop)
    {
        stop=1;
        for(int i=1;i<=L;i++) viz[i]=0;
        for(int i=1;i<=L;i++)
        if( !LtoR[i] )
        {
            bool op=Hopcroft( i );

            if( op )
            {
                stop=0;
                ans++;
            }
        }
    }

    g<<ans<<'\n';
    for(int i=1;i<=L;i++)
        if(LtoR[i]) g<<i<<' '<<LtoR[i]<<'\n';

    return 0;
}