Cod sursa(job #3258888)

Utilizator AlexandruTigauTigau Alexandru AlexandruTigau Data 23 noiembrie 2024 23:57:50
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector<int> v[10005];
int couple[2][10005];
bool viz[10005];
bool wingman(int y)
{
    if(viz[y]) return false;
    viz[y]=1;
    for(auto i:v[y])
        if(!couple[1][i])
    {
        couple[1][i]=y, couple[0][y]=i;
        return true;
    }
    for(auto i:v[y])
        if(wingman(couple[1][i]))
    {
        couple[1][i]=y, couple[0][y]=i;
        return true;
    }
    return false;
}
int main()
{
    int n,m,e;
    f>>n>>m>>e;
    for(int i=1;i<=e;i++)
    {
        int a,b;
        f>>a>>b;
        v[a].push_back(b);
    }
    int cnt=0,ok=1;
    while(ok)
    {
        ok=0;
        memset(viz,0,sizeof(bool)*(n+3));
        for(int i=1;i<=n;i++)
            if(!couple[0][i]&&wingman(i))
                ok++, cnt++;
    }
    g<<cnt<<'\n';
        for(int i=1;i<=n;i++)
            if(couple[0][i])
                g<<i<<" "<<couple[0][i]<<'\n';
    return 0;
}