Cod sursa(job #1562107)

Utilizator TiberiuGCopaciu Tiberiu George TiberiuG Data 4 ianuarie 2016 20:10:52
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
# include <cstdio>
# include <vector>
# define pb push_back
# define N 100010

using namespace std;

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

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

    scanf("%d %d\n", &n, &m);
    for(int i=1; i<=m; ++i)
        scanf("%d %d", &x, &y), G[x].pb(y);

    for(int i=1; i<=n; ++i)
        if(!sel[i])
            df(i);

    for(int i=1; i<=st[0]; ++i)
        printf("%d ", st[i]);

    return 0;
}