Cod sursa(job #1574713)

Utilizator sicsicFMI-Coteanu Vlad sicsic Data 20 ianuarie 2016 19:48:00
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include<fstream>
#include<string.h>
using namespace std;
#define Nmax 10007
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int N,M,E,ST[Nmax],DR[Nmax],nr=0;
bool U[Nmax];
struct lista{int nod; lista *leg;} *G[Nmax];
void adaug(int i,int j)
{
    lista *p;
    p=new lista;
    p->nod=j;
    p->leg=G[i];
    G[i]=p;
}
void citire()
{
    f>>N>>M>>E;
    int i,j;
    while(E--)
    {
        f>>i>>j;
        adaug(i,j);
    }
}
int cuplare(int nod)
{
    if(U[nod]) return 0;
    U[nod]=1;
    for(lista *p=G[nod];p;p=p->leg)
        if(!DR[p->nod]||cuplare(DR[p->nod]))
    {
        ST[nod]=p->nod;
        DR[p->nod]=nod;
        return 1;
    }
    return 0;
}
int main()
{
    citire();
    for(int i=1;i<=N;++i)
    {
        if(ST[i]) continue;
        if(cuplare(i)) nr++;
        else
        {
            memset(U,0,sizeof U);
            if(cuplare(i)) nr++;
        }
    }
    g<<nr<<'\n';
    for(int i=1;i<=N;++i) if(ST[i]) g<<i<<" "<<ST[i]<<'\n';
    return 0;
}