Cod sursa(job #1667959)

Utilizator robertkarolRobert Szarvas robertkarol Data 29 martie 2016 13:35:44
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream fin("cuplaj.in");
ofstream fout("cuplaj.out");
vector<int> v[10001];
int n,shit,m,k,i,t[10001],low[10001],x,y;
bool viz[10001];
int cuplaj(int nod)
{
    int i;
    if(viz[nod]) return 0;
    viz[nod]=1;
    for(i=0;i<v[nod].size();i++)
        if(!t[v[nod][i]])
    {
        t[v[nod][i]]=nod;
        low[nod]=v[nod][i];
        return 1;
    }
    for(i=0;i<v[nod].size();i++)
        if(cuplaj(t[v[nod][i]]))
    {
        t[v[nod][i]]=nod;
        low[nod]=v[nod][i];
        return 1;
    }
    return 0;
}
int main()
{
    fin>>n>>shit>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        if(!low[i]&&cuplaj(i))
        {
            k++;
            memset(viz,0,sizeof(viz));
        }
    fout<<k<<"\n";
    for(i=1;i<=n;i++)
        if(low[i])
            fout<<i<<" "<<low[i]<<"\n";
    return 0;
}