Cod sursa(job #1613110)

Utilizator ovidiuz98Zamfir Ovidiu ovidiuz98 Data 25 februarie 2016 10:49:31
Problema Felinare Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.74 kb
#include <fstream>
#include <vector>
#include <iostream>
#define DIM 8200

using namespace std;

ifstream fin("felinare.in");
ofstream fout("felinare.out");

int N,M,nr,ok,felinare;
vector <int> L[DIM],r(DIM),l(DIM),v(DIM),ans(DIM),sr(DIM),sl(DIM);

int cuplaj(int nod){
    v[nod]=1;

    for(int i=0;i<L[nod].size();i++)
        if(r[L[nod][i]]==0){
            r[L[nod][i]]=nod;
            l[nod] = L[nod][i];
            return 1;
        }

    for(int i=0;i<L[nod].size();i++)
        if(v[r[L[nod][i]]]==0 && cuplaj(r[L[nod][i]])){
            l[nod] = L[nod][i];
            r[L[nod][i]] = nod;
            return 1;
        }

    return 0;
}

void suport(int node){

    vector <int>::iterator it;

    for(it=L[node].begin();it!=L[node].end();it++)
        if(!sr[*it]){
            sr[*it]=1;
            sl[r[*it]]=0;
            suport(r[*it]);
        }

}

int main(){

    fin >> N >> M;

    while(M--){
        int x,y;
        fin >> x >> y;
        L[x].push_back(y);
    }

    do{
        ok=0;
        for(int i=1;i<=N;i++)
            v[i]=0;

        for(int i=1;i<=N;i++)
            if(!l[i] && cuplaj(i)){
                nr++;
                ok=1;
            }
    }while(ok);

    for(int i=1;i<=N;i++)
        if(l[i])
            sl[i]=1;

    for(int i=1;i<=N;i++)
        if(!sl[i])
            suport(i);

    fout << 2*N - nr << "\n";

    for(int i=1;i<=N;i++){
        if(sl[i] && sr[i])
            fout << "0\n";
        else if(!sl[i] && sr[i])
            fout << "1\n";
        else if(sl[i] && !sr[i])
            fout << "2\n";
        else
            fout << "3\n";
        //fout << sl[i] << " " << sr[i] << "\n";
    }

    return 0;
}