Cod sursa(job #1562115)

Utilizator TiberiuGCopaciu Tiberiu George TiberiuG Data 4 ianuarie 2016 20:15:11
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
# include <cstdio>
# include <vector>
# define N 50010
# define M 100010
# define pb push_back
# define bg begin()
# define ed end()

using namespace std;

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

void load()
{
    int x,y;
    scanf("%d %d\n", &n, &m);
    for(; m>0; --m)
    {
        scanf("%d %d\n", &x, &y);
        G[x].pb(y);
    }
}
void Df(int nod)
{
    vector <int> :: iterator it;
    sel[nod]=true;
    for(it=G[nod].bg; it!=G[nod].ed; ++it)
        if(!sel[(*it)])
            Df((*it));
    st[++st[0]]=nod;
}
int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    load();
    for(i=1; i<=n; ++i)
        if(!sel[i])
            Df(i);
    for(i=st[0]; i>=1; --i)
        printf("%d ", st[i]);
}