Cod sursa(job #1110932)

Utilizator mirceadinoMircea Popoveniuc mirceadino Data 18 februarie 2014 14:55:26
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include<cstdio>
#include<vector>
#include<bitset>

using namespace std;

const int NMAX = 50000+2;
const int MMAX = 100000+2;

int N,M;
int PostOrdine[NMAX];
vector<int> V[NMAX];
bitset<NMAX> Viz;

void DFS(int x)
{
    vector<int>::iterator y;
    Viz[x]=1;
    for(y=V[x].begin(); y!=V[x].end(); y++)
        if(Viz[*y]==0) DFS(*y);
    PostOrdine[++M]=x;
}

int main()
{
    int x,y,i;

    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d%d",&N,&M);

    for(; M; --M)
    {
        scanf("%d%d",&x,&y);
        V[x].push_back(y);
    }

    for(i=1; i<=N; i++)
        if(Viz[i]==0) DFS(i);

    for(i=N; i>=1; i--)
        printf("%d ",PostOrdine[i]);

    return 0;
}