Cod sursa(job #1431234)

Utilizator alinmocanu95FMI Alin Mocanu alinmocanu95 Data 9 mai 2015 03:46:41
Problema Cuplaj maxim in graf bipartit Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.22 kb
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
vector <int> v[11000];
int viz[11000],numar,n,m,e,i,j,x,y,stanga[11000],dreapta[11000],ok;
int pair_up(int nod)
{
  viz[nod]=1;
  for(int i=0;i<v[nod].size();i++)
  {
      if(stanga[v[nod][i]]==0)
      {
          dreapta[nod]=v[nod][i];
          stanga[v[nod][i]]=nod;
          return 1;
      }
      if(viz[stanga[v[nod][i]]]==0)
        if(pair_up(stanga[v[nod][i]])==1)
        {
            stanga[v[nod][i]]=nod;
            dreapta[nod]=v[nod][i];
            return 1;
        }
  }
  return 0;
}

int main()
{
    ifstream f("cuplaj.in");
    ofstream g("cuplaj.out");
    f>>n>>m>>e;

    for(i=1;i<=e;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
ok=1;numar=0;
    while(ok==1)
    {
        ok=0;
        for(j=1;j<=n;j++) viz[j]=0;

        for(j=1;j<=n;j++)
            if(dreapta[j]==0)
                if(viz[j]==0)
                    if(ok==1||pair_up(j)==1) ok=1;
                    else ok=0;
    }
    for(i=1;i<=m;i++)
        if(stanga[i]!=0) numar++;

    g<<numar<<"\n";
    for(i=1;i<=m;i++)
        if(stanga[i]!=0)
        g<<stanga[i]<<" "<<i<<"\n";

    return 0;
}