Cod sursa(job #2573592)

Utilizator NashikAndrei Feodorov Nashik Data 5 martie 2020 18:17:23
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.1 kb
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("cuplaj.in");
ofstream cout("cuplaj.out");
vector<int> v[10005];
int n,m,e,a,b,viz[10005],st[10005],dr[10005];
bool cup(int nod){
    if(viz[nod]==1)
        return false;
    viz[nod]=1;
    for(auto u:v[nod]){
        if(dr[u]==0){
            st[nod]=u;
            dr[u]=nod;
            return true;
        }
    }
    for(auto u:v[nod]){
        if(cup(dr[u])==true){
            st[nod]=u;
            dr[u]=nod;
            return true;
        }
    }
    return false;
}
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(prevcnt!=cnt);
    cout<<cnt<<"\n";
    for(int i=1;i<=n;i++){
        if(st[i]!=0){
            cout<<i<<" "<<st[i]<<"\n";
        }
    }
    return 0;
}