Cod sursa(job #3220666)

Utilizator diana_dd03Dorneanu Diana diana_dd03 Data 4 aprilie 2024 16:57:48
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.05 kb
#include<bits/stdc++.h>
using namespace std;

ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");

int n, m, e, x, y, cuplaj, sol;
int vis[10005], st[10005], dr[10005];
vector<int>ad[10005];

int cupleaza(int nod){
    if(vis[nod])
        return 0;
    vis[nod]=1;
    for(int v : ad[nod])
        if(!dr[v]){
            st[nod]=v;
            dr[v]=nod;
            return 1;
        }
    for(int v : ad[nod]){
        if(cupleaza(dr[v])){
            st[nod]=v;
            dr[v]=nod;
            return 1;
        }
    }
    return 0;
}

int main(){
    fin>>n>>m>>e;
    for(int i=1;i<=e;i++){
        fin>>x>>y;
        ad[x].push_back(y);
    }
    cuplaj=1;
    while(cuplaj){
        cuplaj=0;
        for(int i=1;i<=n;i++)
            vis[i]=0;
        for(int i=1;i<=n;i++)
            if(st[i]==0 && cupleaza(i)){
                ++sol;
                cuplaj=1;
            }
    }
    fout<<sol<<'\n';
    for(int i=1;i<=n;i++)
        if(st[i])
            fout<<i<<" "<<st[i]<<"\n";
    return 0;
}