Cod sursa(job #2487994)

Utilizator vladcociorvaVlad Cociorva vladcociorva Data 5 noiembrie 2019 22:31:20
Problema Sortare topologica Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include <bits/stdc++.h>
#define NMAX 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
vector<vector<int>>g, res;
bool vis[NMAX];
stack<int>s;
void topSort (int x)
{
  vis[x] = 1;
  for (auto u: g[x])
    if (!vis[u])
      topSort(u);
  s.push(x);
}
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> m;
  g.resize(n+1);
  for (int i = 1; i <= m; ++i)
  {
    int x, y;
    cin >> x >> y;
    g[x].push_back(y);
  }
  for (int i = 1; i <= n; ++i)
  {
    if (!vis[i])
      topSort(i);
  }
  while(!s.empty()){
    cout << s.top() << ' ';
    s.pop();
  }
}