Cod sursa(job #884982)

Utilizator deea101Andreea deea101 Data 21 februarie 2013 15:39:45
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <fstream>
#include <vector>
#define nmax 10001
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
vector <int> vec[nmax];
int n1,n2,prec[nmax],urm[nmax],use[nmax];
int cupleaza(int nod)
{
    int i;
    if(use[nod]) return 0;
    use[nod]=1;
    for(i=0;i<vec[nod].size();i++)
        if(!prec[vec[nod][i]])
        {
            prec[vec[nod][i]]=nod;
            urm[nod]=vec[nod][i];
            return 1;
        }
    for(i=0;i<vec[nod].size();i++)
        if(cupleaza(prec[vec[nod][i]]))
        {
            prec[vec[nod][i]]=nod;
            urm[nod]=vec[nod][i];
            return 1;
        }
    return 0;
}
int main()
{

    int i,m,x,y,ok=1;;
    f>>n1>>n2>>m;
    for(i=0;i<m;i++)
    {
        f>>x>>y;
        vec[x].push_back(y);
    }
    ok=1;
    while(ok)
    {
        ok=0;
        for(i=1;i<=n1;i++) use[i]=0;
        for(i=1;i<=n1;i++)
        {
            if(!urm[i] && cupleaza(i)) ok=1;
        }
    }

    for(i=1;i<=n1;i++)
        if(urm[i]) ok++;

    g<<ok<<'\n';
    for(i=1;i<=n1;i++)
        if(urm[i]) g<<i<<' '<<urm[i]<<'\n';
}