Cod sursa(job #2695830)

Utilizator raresmateiuMateiu Rares-Ioan raresmateiu Data 14 ianuarie 2021 17:50:27
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <bits/stdc++.h>
using namespace std;

#define NMAX 10010

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

int st[NMAX],dr[NMAX],viz[NMAX];
vector <int> v[NMAX];
int n,m,e,ok=1,x,y;

int pairup(int nod)
{
    int i,vec;

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

    for(i=0; i<v[nod].size(); i++)
    {
        vec=v[nod][i];
        if(!dr[vec] || pairup(dr[vec]))
        {
            dr[vec]=nod;
            st[nod]=vec;
            return 1;
        }
    }

    return 0;

}

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

    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(i=1; i<=n; i++)
            if(!st[i] && pairup(i))
                ok=1;
    }
    for(i=1; i<=n; i++)
        if(st[i])
            nr++;
    g<<nr<<'\n';
    for(i=1; i<=n; i++)
        if(st[i])
            g<<i<<' '<<st[i]<<'\n';
    return 0;
}