Cod sursa(job #2328230)

Utilizator usureluflorianUsurelu Florian-Robert usureluflorian Data 25 ianuarie 2019 15:32:54
Problema Cuplaj maxim in graf bipartit Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.17 kb
#include <bits/stdc++.h>
using namespace std;
ifstream f ("cuplaj.in");
ofstream g ("cuplaj.out");
const int nmax=1e4+3;
int viz[nmax],st[nmax],dr[nmax],n,m,t,a,b,ok,k;
vector <int> v[nmax];
inline 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]])
        {
            st[v[nod][i]]=nod;
            dr[nod]=v[nod][i];
            return 1;
        }
    }
    for(int i=0;i<v[nod].size();++i)
    {
        if(cuplaj(st[v[nod][i]]))
        {
            st[v[nod][i]]=nod;
            dr[nod]=v[nod][i];
            return 1;
        }
    }
    return 0;
}
int main()
{
    ios::sync_with_stdio(false);
    f>>n>>m>>t;
    while(t--)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
    ok=1;
    while(ok)
    {
        ok=0;
        memset(viz,0,sizeof(viz));
        for(int i=1;i<=n;++i)
        {
            if(!dr[i])
            {
                if(cuplaj(i)) ok=1;
            }
        }
    }
    for(int i=1;i<=n;++i) if(dr[i]) ++k;
    g<<k<<'\n';
    for(int i=1;i<=n;++i) if(dr[i]) g<<i<<' '<<dr[i]<<'\n';
    return 0;
}