Cod sursa(job #2122607)

Utilizator cicero23catalin viorel cicero23 Data 5 februarie 2018 12:32:07
Problema Cuplaj maxim in graf bipartit Scor 24
Compilator cpp Status done
Runda Arhiva educationala Marime 1.1 kb
#include <iostream>
#include <fstream>
#include <string.h>
#include <vector>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector<int> v[10001];

int viz[10001],st[10001],dr[10001];
int push_up(int x)
{
    int i;
    if(viz[x]) return 0;
    viz[x]=1;
    for(i=0;i<v[x].size();i++)
    if(dr[v[x][i]]==0)
    {
        st[x]=v[x][i];
        dr[v[x][i]]=x;
        return 1;
    }
    for(i=0;i<v[x].size();i++)
    if(push_up(v[x][i]))
    {
        st[x]=v[x][i];
        dr[v[x][i]]=x;
        return 1;
    }
    return 0;
}
int main()
{
    int n1,n2,m,i,x,y,ok;
    f>>n1>>n2>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        //v[y].push_back(x);
    }
    ok=1;
    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(i=1;i<=n1;i++)
        if(!st[i])
           ok|= push_up(i);
    }
    int k=0;
    for(i=1;i<=n1;i++)
    {
        if(st[i]!=0)k++;
    }
    g<<k<<'\n';
    for(i=1;i<=n1;i++)
    {
        if(st[i]!=0)g<<i<<" "<<st[i]<<'\n';
    }
    return 0;
}