Cod sursa(job #1430342)

Utilizator sanzianaioneteIonete Sanziana sanzianaionete Data 8 mai 2015 11:20:54
Problema Cuplaj maxim in graf bipartit Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 1.25 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int nr=0,n,m,e,L[10001],R[10001],viz[10001];
vector <int> muchii[10001];
void pairup(int nod)
{
    int l=muchii[nod].size();
    for(int i=0;i<l;i++)
    {
        if(!R[muchii[nod][i]])
        {
            R[muchii[nod][i]]=nod;
            L[nod]=muchii[nod][i];
            nr++;
            return;
        }
    }
    for(int i=0;i<l;i++)
    {
        int kick=R[muchii[nod][i]];
        //pairup(kick);
        int lg=muchii[kick].size();
        for(int j=0;j<lg;j++)
        {
            if(!R[muchii[kick][j]])
            {
                R[muchii[kick][j]]=kick;
                L[kick]=muchii[kick][j];
                nr++;
                R[muchii[nod][i]]=nod;
                L[nod]=muchii[nod][i];
                return;
            }
        }
    }
}
int main()
{
    f>>n>>m>>e;
    for(int i=0;i<e;i++)
    {
        int x,y;
        f>>x>>y;
        muchii[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        pairup(i);
    }
    g<<nr<<"\n";
    for(int i=1;i<=n;i++)
    {
        if(L[i])
            g<<i<<' '<<L[i]<<"\n";
    }
    f.close();g.close();
    return 0;
}