Cod sursa(job #1375337)

Utilizator OnimushaLordTiberiu Copaciu OnimushaLord Data 5 martie 2015 13:00:43
Problema Sortare topologica Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
# include <cstdio>
# include <vector>
# define N 50000
# define pb push_back

using namespace std;

vector <int> G[N];
int st[N],sel[N];
int n,m,i,x,y;

void df(int nod)
{
    sel[nod]=true;
    for(vector <int> :: iterator it=G[nod].begin(); it!=G[nod].end(); ++it)
        if(!sel[(*it)]) df((*it));
    st[++st[0]]=nod;
}
int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    scanf("%d %d\n", &n, &m);
    for(i=1; i<=m; ++i)
    {
        scanf("%d %d", &x, &y);
        G[x].pb(y);
    }
    for(i=1; i<=n; ++i)
        if(!sel[i]) df(i);

    df(1);
    for(i=st[0]-1; i>=1; --i)
        printf("%d ", st[i]);

}