Cod sursa(job #2665049)

Utilizator NashikAndrei Feodorov Nashik Data 29 octombrie 2020 22:35:14
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.08 kb
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector<int> v[10005];
bool viz[10005];
int n,m,e,a,b,st[10005],dr[10005];
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out");
int cup(int w){
    if(viz[w]==1)
        return 0;
    viz[w]=1;
    for(auto u:v[w]){
        if(dr[u]==0){
            dr[u]=w;
            st[w]=u;
            return 1;
        }
    }
    for(auto u:v[w]){
        if(cup(dr[u])==1){
            st[w]=u;
            dr[u]=w;
            return 1;
        }
    }
    return 0;
}
int main(){
    cin>>n>>m>>e;
    for(int i=1;i<=e;i++){
        cin>>a>>b;
        v[a].push_back(b);
    }
    int cnt=0,prevcnt=0;
    do{
        prevcnt=cnt;
        for(int i=1;i<=n;i++){
            viz[i]=0;
        }
        for(int i=1;i<=n;i++){
            if(st[i]==0){
                cnt+=cup(i);
            }
        }
    }while(cnt!=prevcnt);
    cout<<cnt<<"\n";
    for(int i=1;i<=n;i++){
        if(st[i]!=0){
            cout<<i<<" "<<st[i]<<"\n";
        }
    }
    return 0;
}