Cod sursa(job #1086834)

Utilizator nicnic28nichita trita nicnic28 Data 18 ianuarie 2014 16:34:41
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
//
fstream in("sortaret.in",ios::in),out("sortaret.out",ios::out);
const int N=50001;

int n,v[N];
vector<int> a[N],r;
void dfs(int p){
    v[p]=-1;
    r.push_back(p);
    for(int i=0 ; i<a[p].size() ; i++){
        v[a[p][i]]--;
        if(v[a[p][i]]==0)
            dfs(a[p][i]);
    }
}

int main()
{
    int x,y;
    in>>n>>y;
    for(int i=1 ; i<=n ; i++){
        in>>x>>y;
        v[y]++;
        a[x].push_back(y);
    }
    for(int i=1 ; i<=n ; i++){
        if(v[i]==0) dfs(i);
    }
    for(int i=0 ; i<r.size() ; i++){
        out<<v[i]<<' ';
    }
    return 0;
}