Cod sursa(job #2693849)

Utilizator TudorCretuCretu Tudor Andrei TudorCretu Data 7 ianuarie 2021 11:50:20
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <fstream>
#include <vector>
#include <string.h>
#define nmx 10100
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,x,y,nr=0,ok=1,e;
int st[nmx],dr[nmx],viz[nmx];
vector <int> v[nmx];
int kendama(int nod)
{
    int i,vc;
    if(viz[nod]) return 0;
    viz[nod]=1;
    for(i=0;i<v[nod].size();i++)
    {
        vc=v[nod][i];
        if(!dr[vc] || kendama(dr[vc]))
        {
            dr[vc]=nod;
            st[nod]=vc;
            return 1;
        }
    }
    return 0;
}
int main()
{
    int i;
    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] && kendama(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;
}