Cod sursa(job #1430345)

Utilizator danielmaxim95FMI Maxim Daniel danielmaxim95 Data 8 mai 2015 11:28:50
Problema Cuplaj maxim in graf bipartit Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.51 kb
#include <cstdio>
#include <vector>
#include <string.h>

using namespace std;

vector <int> l[10001], r[10001];
int n, m, e, cl[10001], cr[10001];
bool viz[10001];

void citeste()
{
    FILE *f = fopen("cuplaj.in", "r");
    int x,y;
    
    fscanf(f, "%i%i%i", &n, &m, &e);
    for(int i=0; i<e; i++)
    {
        fscanf(f, "%i%i", &x, &y);
        l[x].push_back(y);
        r[y].push_back(x);
    }
    fclose(f);
    memset(viz, false, n);
    memset(cl, 0, n);
    memset(cr, 0, m);
}

int elibereaza(int x)
{
    viz[x] = true;
    for(int i=0; i<l[x].size(); i++)
        if(!cr[l[x][i]])
        {
            cl[x]=l[x][i];
            cr[l[x][i]]=x;
            viz[x] = false;
            return true;
        }
    for(int i=0; i<l[x].size(); i++)
        if(cl[x] != i && cr[l[x][i]] != x && !viz[l[x][i]])
        {
            viz[x] = false;
            return elibereaza(l[x][i]);
        }
    viz[x] = false;
    return false;
}

void cupleaza(int x)
{
    for(int i=0; i<l[x].size(); i++)
        if(!cr[l[x][i]])
        {
            cl[x]=l[x][i];
            cr[l[x][i]]=x;
            return;
        }
    for(int i=0; i<l[x].size(); i++)
        if(elibereaza(l[x][i]))
        {
            cl[x]=l[x][i];
            cr[l[x][i]]=x;
            return;
        }
}

int main()
{
    citeste();
    for(int i=1; i<=n; i++)
    {
        cupleaza(i);
    }
    for(int i=1; i<=n; i++)
        printf("%i - %i\n", i, cl[i]);
    return 0;
}