Cod sursa(job #2693028)

Utilizator monica_LMonica monica_L Data 4 ianuarie 2021 16:26:59
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.95 kb
#include <fstream>
#define nmax 10010
#include <vector>
#include <string.h>
using namespace std;
int st[nmax],dr[nmax],viz[nmax];
vector <int> v[nmax];
int n,m,e,ok=1,x,y;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
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;
}