Cod sursa(job #2570902)

Utilizator spartanul300Vasile Andrei spartanul300 Data 4 martie 2020 19:55:02
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.28 kb
#include <bits/stdc++.h>

using namespace std;

ifstream f("cuplaj.in");
ofstream g("cuplaj.out");

vector <int> v[10100];
int viz[10100],M1[10100],M2[10100];

int cupleaza(int nod)
{
    if(viz[nod]==1)return 0;

    viz[nod]=1;
    for(int i=0;i<v[nod].size();i++)
    {
        int vecin=v[nod][i];
        if(M2[vecin]==0)
        {
            M2[vecin]=nod;
            M1[nod]=vecin;
            return 1;
        }
    }

    for(int i=0;i<v[nod].size();i++)
    {
        int vecin=v[nod][i];
        if(cupleaza(M2[vecin]))
        {
            M2[vecin]=nod;
            M1[nod]=vecin;
            return 1;
        }
    }

    return 0;
}

int n,m,x,y,OK,legiuni,e,i;
int main()
{
    f>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }

    OK=1;
    while(OK)
    {
        OK=0;

        for(i=1;i<=n;i++)viz[i]=0;
        for(i=1;i<=n;i++)
        {
            if(M1[i]==0)
            {
                int ok=cupleaza(i);
                if(ok==1)
                {
                    OK=1;
                    legiuni++;
                }
            }
        }
    }

    g<<legiuni<<'\n';
    for(i=1;i<=n;i++)
        if(M1[i]!=0)g<<i<<" "<<M1[i]<<'\n';
    return 0;
}