Cod sursa(job #2428365)

Utilizator AlexPop28Pop Alex-Nicolae AlexPop28 Data 4 iunie 2019 22:03:06
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.12 kb
#include <bits/stdc++.h>
#define DEBUG(x) cerr << (#x) << ": " << (x) << '\n'

using namespace std;

vector<int> getTopo(vector<vector<int>> &adj) {
  int n = adj.size();
  vector<int> deg(n);
  for (int i = 0; i < n; ++i) {
    for (int &x : adj[i]) {
      ++deg[x];
    }
  }
  vector<int> order;
  order.reserve(n);
  for (int i = 0; i < n; ++i) {
    if (deg[i] == 0) {
      order.emplace_back(i);
    }
  }
  assert(!order.empty());
  for (int i = 0; i < n; ++i) {
    int node = order[i];
    for (int &x : adj[node]) {
      if (--deg[x] == 0) {
        order.emplace_back(x);
      }
    }
  }
  return order;
}

int main() {
  freopen("sortaret.in", "r", stdin);
  freopen("sortaret.out", "w", stdout);
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n, m;
  cin >> n >> m;
  vector<vector<int>> adj(n);
  for (int i = 0; i < m; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    adj[u].emplace_back(v);
  }
  
  auto ans = getTopo(adj);
  
  for (int &x : ans) {
    cout << x + 1 << ' ';
  }
  cout << endl;

#ifdef LOCAL_DEFINE
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}