Cod sursa(job #1624364)

Utilizator superstar1998Moldoveanu Vlad superstar1998 Data 2 martie 2016 10:35:51
Problema Cuplaj maxim in graf bipartit Scor 80
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("cuplaj.in");
ofstream g("cuplaj.out");
int n,m,cnt,l[10001],r[10001],a,b;
bitset<100001> use;
vector<int> G[10001];
int pairup(int n)
{
    if(use[n])return 0;
    use[n]=1;
    vector<int>::iterator it;
    for(it=G[n].begin();it!=G[n].end();++it)
        if(!r[*it]||pairup(r[*it]))
        {
            l[n]=*it;
            r[*it]=n;
            return 1;
        }
    return 0;
}
int main()
{
    f>>n>>m>>cnt;
    for(;cnt--;)
    {
        f>>a>>b;
        G[a].push_back(b);
    }
    int cuplaj=0;
    for(int i=1;i<=n;i++)
        if(!l[i])
        {
            if(!pairup(i))
            {
                use.reset();
                cuplaj+=pairup(i);
            }
            else cuplaj++;
        }
    g<<cuplaj<<'\n';
    for(int i=1;i<=n;i++)
        if(l[i])g<<i<<" "<<l[i]<<'\n';
    return 0;
}