Cod sursa(job #2181421)

Utilizator usureluflorianUsurelu Florian-Robert usureluflorian Data 21 martie 2018 17:41:54
Problema Cuplaj maxim in graf bipartit Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.95 kb
#include <fstream>
#include <vector>
#include <cstring>
using namespace std;
ifstream f ("cuplaj.in");
ofstream g ("cuplaj.out");
const int nmax=1e4+3;
int viz[nmax],st[nmax],dr[nmax],a,b,m,t1,t2,ok,sol;
vector <int> v[nmax];
bool cuplaj(int nod)
{
    if(viz[nod]) return 0;
    viz[nod]=1;
    for(int i=0;i<v[nod].size();++i)
    {
        if(!st[v[nod][i]]||cuplaj(v[nod][i]))
        {
            st[v[nod][i]]=nod;
            dr[nod]=v[nod][i];
            return 1;
        }
    }
    return 0;
}
int main()
{
    f>>a>>b>>m;
    while(m--)
    {
        f>>t1>>t2;
        v[t1].push_back(t2);
    }
    ok=1;
    while(ok)
    {
        ok=0;
        memset(viz,0,sizeof(viz));
        for(int i=1;i<=a;++i)
        {
            if(!st[i]&&cuplaj(i)) ok=1;
        }
    }
    for(int i=1;i<=a;++i) if(dr[i]) ++sol;
    g<<sol<<'\n';
    for(int i=1;i<=a;++i) if(dr[i]) g<<i<<' '<<dr[i]<<'\n';
    return 0;
}