Cod sursa(job #1840928)

Utilizator SagunistuStrimbu Alexandru Sagunistu Data 4 ianuarie 2017 23:24:28
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <cstdio>
#include <vector>
#define nmax 50005

using namespace std;

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

void citire()
{
    int x,y;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>x>>y;
        g[x].push_back(y);
    }
}

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

void rezolv()
{
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
}

void afisare()
{
    for(int i=vf;i>=1;i--)
        cout<<st[i]<<" ";
    cout<<"\n";
}

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