Cod sursa(job #1720350)

Utilizator refugiatBoni Daniel Stefan refugiat Data 22 iunie 2016 08:57:11
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
using namespace std;
ifstream si("cuplaj.in");
ofstream so("cuplaj.out");
vector<int> v[10010];
int cup1[10010],cup2[10010];
bitset<10010> vaz;
bool cup(int nod)
{
    if(vaz[nod])
        return 0;
    vaz[nod]=1;
    vector<int>::iterator it;
    for(it=v[nod].begin();it!=v[nod].end();it++)
        if(!cup2[*it]||cup(cup2[*it]))
        {
            cup1[nod]=*it;
            cup2[*it]=nod;
            return 1;
        }
    return 0;
}
int main()
{
    int n,m,e,x,y,nr=0;
    si>>n>>m>>e;
    int i;
    for(i=1;i<=e;i++)
    {
        si>>x>>y;
        v[x].push_back(y);
    }
    bool ok=1;
    while(ok)
    {
        ok=false;
        for(i=1;i<=n;i++)
            vaz[i]=0;
        for(i=1;i<=n;i++)
            if(!cup1[i])
                ok=(cup(i)||ok);
    }
    for(i=1;i<=n;i++)
        if(cup1[i])
            nr++;
    so<<nr<<'\n';
    for(i=1;i<=n;i++)
        if(cup1[i])
           so<<i<<' '<<cup1[i]<<'\n';
    return 0;
}