Cod sursa(job #2558306)

Utilizator NashikAndrei Feodorov Nashik Data 26 februarie 2020 14:34:49
Problema Cuplaj maxim in graf bipartit Scor 28
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector<int> v[100005];
int st[100005],dr[100005];
bool viz[100005];
int cup(int nod){

    if(viz[nod]==1){
        return 0;
    }
    viz[nod]=1;
    for(auto u:v[nod]){
        if(dr[u]==0){
            st[nod]=u;
            dr[u]=nod;
            return 1;
        }
    }
    for(auto u:v[nod]){
        if(cup(dr[u])==1){
            st[nod]=u;
            st[u]=nod;
            return 1;
        }
    }
    return 0;
}
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out");
int main(){
    int n,m,e,a,b;
    cin>>n>>m>>e;
    for(int i=1;i<=e;i++){
        cin>>a>>b;
        v[a].push_back(b);
    }
    int prevcnt=0,cnt=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(prevcnt!=cnt);
    cout<<cnt<<"\n";
    for(int i=1;i<=n;i++){
        if(st[i]!=0){
            cout<<i<<" "<<st[i]<<"\n";
        }
    }
}
/**
3 3 6
1 1
1 2
2 1
3 1
3 2
3 3
*/