Cod sursa(job #1769073)

Utilizator teoionescuIonescu Teodor teoionescu Data 1 octombrie 2016 21:21:51
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include<bits/stdc++.h>
using namespace std;
ifstream in("cuplaj.in");
ofstream out("cuplaj.out");
const int Nmax = 10001;
vector<int> L[Nmax];
int l[Nmax],r[Nmax],mk[Nmax];
int n,m,q;
int cup(int x){
    if(mk[x]) return 0;
    mk[x]=1;
    for(auto p : L[x]){
        if(r[p]==0 || cup(r[p])){
            l[x]=p;
            r[p]=x;
            return 1;
        }
    }
    return 0;
}
int main(){
    in>>n>>m>>q;
    int x,y;
    for(int i=1;i<=q;i++){
        in>>x>>y;
        L[x].push_back(y);
    }
    int flag=1;
    while(flag){
        flag=0;
        for(int i=1;i<=n;i++){
            if(!l[i]){
                int rez=cup(i);
                flag|=rez;
                mk[0]+=rez;
                fill_n(mk+1,n,0);
            }
        }
    }
    out<<mk[0]<<'\n';
    for(int i=1;i<=n;i++){
        if(l[i]) out<<i<<' '<<l[i]<<'\n';
    }
    return 0;
}