This documentation is automatically generated by online-judge-tools/verification-helper
#include "../template.hh"
int N;
vvi adj(N);
vi in(N); // in degree for every node
vi toposort() {
vi q; // Result saved in q
F0R (i, N)
if (!in[i]) q.pb(i);
F0R (i, SZ(q))
for (int v : adj[q[i]])
if (!--in[v]) q.pb(v);
return q;
}
#line 1 "code/template.cc"
// this line is here for a reason
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define endl '\n'
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) (int)(x).size()
#define FOR(a, b, c) for (auto a = (b); (a) < (c); ++(a))
#define F0R(a, b) FOR (a, 0, (b))
template <typename T>
bool ckmin(T& a, const T& b) { return a > b ? a = b, true : false; }
template <typename T>
bool ckmax(T& a, const T& b) { return a < b ? a = b, true : false; }
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout if (DEBUG) cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#line 2 "code/graphs/topoSort.cc"
int N;
vvi adj(N);
vi in(N); // in degree for every node
vi toposort() {
vi q; // Result saved in q
F0R (i, N)
if (!in[i]) q.pb(i);
F0R (i, SZ(q))
for (int v : adj[q[i]])
if (!--in[v]) q.pb(v);
return q;
}