Cod sursa(job #3258885)

Utilizator AlexandruTigauTigau Alexandru AlexandruTigau Data 23 noiembrie 2024 23:32:19
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.01 kb
#include <fstream>
#include <queue>
#include <vector>
#include <cstring>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector<int> v[2][10005];
int couple[2][10005],viz[2][10005],lastit;
bool wingman(int x, int y)
{
    viz[x][y]=lastit;
    for(auto i:v[x][y])
        if(!couple[1-x][i])
    {
        couple[1-x][i]=y, couple[x][y]=i;
        return true;
    }
    for(auto i:v[x][y])
        if(viz[x][couple[1-x][i]]!=lastit&&wingman(x,couple[1-x][i]))
    {
        couple[1-x][i]=y, couple[x][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[0][a].push_back(b);
        v[1][b].push_back(a);
    }
    int cnt=0;
    for(int i=1;i<=n;i++)
    {
        int x=0,y=i;
        lastit++;
        if(!couple[x][y])
            cnt+=wingman(x,y);
    }
    g<<cnt<<'\n';
    for(int i=1;i<=n;i++)
        if(couple[0][i])
            g<<i<<" "<<couple[0][i]<<'\n';
    return 0;
}