Cod sursa(job #1463870)

Utilizator SagunistuStrimbu Alexandru Sagunistu Data 21 iulie 2015 17:48:16
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <cstdio>
#include <vector>
#define nmax 50005

using namespace std;

vector<int>g[nmax];
int n,m,viz[nmax],st[nmax],vf,ap[nmax];

void citire()
{
    int a,b;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
    }
}

void dfs(int k)
{
    viz[k]=0;
    for(vector<int>::iterator ii=g[k].begin();ii!=g[k].end();++ii)
        if(viz[*ii]==0)
            dfs(*ii);
    st[++vf]=k;
    ap[k]=1;
}

void afisare()
{
    for(int i=vf;i>=1;i--)
        printf("%d ",st[i]);
    for(int i=1;i<=n;i++)
        if(ap[i]==0)
            printf("%d ",i);
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    dfs(1);
    afisare();
    return 0;
}