Cod sursa(job #849730)

Utilizator sleepaholicNeculaescu Theodor sleepaholic Data 7 ianuarie 2013 15:57:12
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <fstream>
#include <vector>

using namespace std;

#define Amax 50001

ifstream fi("sortaret.in");
ofstream fo("sortaret.out");

int i,n,m,gr[Amax],l[Amax]; vector<int> G[Amax];

void readData(){
    int a,b;

    fi >> n >> m;
    for (i=1; i<=m; i++)
        fi >> a >> b, G[a].push_back(b), gr[b]++;
}

void solve(){
    int x; vector<int>::iterator it;

    for (i=1; i<=n; i++) if (!gr[i]) l[++l[0]]=i;

    for (i=1; i<=n; i++){
        x=l[i];
        for (it=G[x].begin(); it != G[x].end(); it++){
            gr[*it]--; if (!gr[*it]) l[++l[0]]=*it;
        }
    }
}

void writeData(){
    for (i=1; i<=n; i++) fo << l[i] << " ";
}

int main(){

    readData();
    solve();
    writeData();

    return 0;
}