Cod sursa(job #3334274)

Utilizator liadariaLia Daria Ostafi liadaria Data 17 ianuarie 2026 10:02:09
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.21 kb
#include <fstream>
#include <vector>
#define NMAX 10001
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
int n,m,e;
int cuplaj;
int l[NMAX],r[NMAX];
vector<int>muchii[NMAX];
bool use[NMAX];
bool pairup(int nod);

int main()
{
    int i,a,b;
    bool ok;
    fin>>n>>m>>e;
    for(i=1;i<=e;i++)
    {
        fin>>a>>b;
        muchii[a].push_back(b);
    }
    do
    {
        ok=0;
        for(i=1;i<=n;i++) use[i]=0;
        for(i=1;i<=n;i++)
            if(l[i]==0 && pairup(i))
                ok=1;
    }while(ok);
    for(i=1;i<=n;i++)
        if(l[i]) cuplaj++;
    fout<<cuplaj<<'\n';
    for(i=1;i<=n;i++)
        if(l[i])
        fout<<i<<' '<<l[i]<<'\n';
    return 0;
}
bool pairup(int nod)
{
    int i;
    if(use[nod]) return 0;
    use[nod]=1;
    for(i=0;i<muchii[nod].size();i++)
        if(r[muchii[nod][i]]==0)
        {
            r[muchii[nod][i]]=nod;
            l[nod]=muchii[nod][i];
            return 1;
        }
    for(i=0;i<muchii[nod].size();i++)
        if(pairup(r[muchii[nod][i]]))
        {
            r[muchii[nod][i]]=nod;
            l[nod]=muchii[nod][i];
            return 1;
        }
    return 0;
}