Cod sursa(job #2693048)

Utilizator monica_LMonica monica_L Data 4 ianuarie 2021 17:17:38
Problema Felinare Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.44 kb
#include <fstream>
#define nmax 10000
#include <vector>
#include <string.h>
using namespace std;
ifstream f("felinare.in");
ofstream g("felinare.out");
int st[nmax],dr[nmax],viz[nmax],n,m,ok,x,y,nr;
bool apst[nmax],apdr[nmax];
vector <int> v[nmax];
int pairup(int i)
{
    int vec,j;

    if(viz[i]) return 0;
    viz[i]=1;

    for(j=0; j<v[i].size(); j++)
    {
        vec=v[i][j];
        if(!dr[vec] || pairup(dr[vec]))
        {
            st[i]=vec;
            dr[vec]=i;
            apst[i]=1;
            return 1;
        }
    }
    
    return 0;
}

void df(int i)
{
    int j,vec;
    for(j=0;j<v[i].size();j++)
    {
        vec=v[i][j];
        if(!apdr[vec])
        {
            apdr[vec]=1;
            apst[dr[vec]]=0;
            df(dr[vec]);
        }
    }
}
int main()
{
    int i;
    f>>n>>m;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }

    ok=1;
    while(ok)
    {
        memset(viz,0,sizeof(viz));
        ok=0;
        for(i=1; i<=n; i++)
            if(!st[i] && pairup(i)) ok=1;
    }

    for(i=1;i<=n;i++)
      if(st[i]) nr++;
    g<<2*n-nr<<'\n';
    
    for(i=1;i<=n;i++)
        if(!apst[i]) df(i);

    for(i=1;i<=n;i++)
    {
        if(!apst[i] && !apdr[i]) g<<3<<'\n';
        else if(apst[i] && !apdr[i]) g<<2<<'\n';
        else if(!apst[i] && apdr[i]) g<<1<<'\n';
        else g<<0<<'\n';
    }
    return 0;
}