Cod sursa(job #2663967)

Utilizator qThunderStefan Durlanescu qThunder Data 27 octombrie 2020 18:11:36
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.15 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
vector <int> v[10004];
int vv[10004],l[10004],r[10004],s,n,m,t,x,y,k;
bool cuplaj(int i)
{
    if(vv[i]==1)
        return 0;
    vv[i]=1;
    for(int j=0;j<v[i].size();j++)
    {
        int vecin=v[i][j];
        if(r[vecin]==0)
        {
            l[i]=vecin;
            r[vecin]=i;
            s++;
            return 1;
        }

    }
    for(int j=0;j<v[i].size();j++)
    {
        int vecin=v[i][j];
        if(cuplaj(r[vecin])==true)
        {
            l[i]=vecin;
            r[vecin]=i;
            return 1;
        }

    }
    return 0;
}
int main()
{
    fin>>n>>m>>t;
    for(int i=1;i<=t;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    k=1;
    while(k)
    {
        k=0;
        for(int i=1;i<=n;i++)
            vv[i]=0;
        for(int i=1;i<=n;i++)
        {
            if(l[i]==0)
                k+=cuplaj(i);
        }
    }
    fout<<s<<"\n";
    for(int i=1;i<=n;i++)
        if(l[i]!=0)
            fout<<i<<" "<<l[i]<<"\n";
    return 0;
}