1a:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1d:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T4ad,#include using namespace std; int main() { int n, m; cin >> n >> m; vector> adj(n + 1); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); } for (int i = 1; i <= n; i++) sort(adj[i].begin(), adj[i].end()); vector color(n + 1, 0), it(n + 1, 0); vector post; bool hasCycle = false; for (int start = 1; start <= n; start++) { if (color[start] != 0) continue; vector stack; stack.push_back(start); color[start] = 1; while (!stack.empty()) { int u = stack.back(); if (it[u] < (int)adj[u].size()) { int v = adj[u][it[u]++]; if (color[v] == 0) { color[v] = 1; stack.push_back(v); } else if (color[v] == 1) hasCycle = true; } else { color[u] = 2; post.push_back(u); stack.pop_back(); } } } if (hasCycle) { cout << -1 << "\n"; return 0; } reverse(post.begin(), post.end()); for (size_t i = 0; i < post.size(); i++) cout << post[i] << (i + 1 < post.size() ? " " : "\n"); return 0; } 1c:T4ad,#include using namespace std; int main() { int n, m; cin >> n >> m; vector> adj(n + 1); for (int i = 0; i < m; i++) { int x, y; cin >> x >> y; adj[x].push_back(y); } for (int i = 1; i <= n; i++) sort(adj[i].begin(), adj[i].end()); vector color(n + 1, 0), it(n + 1, 0); vector post; bool hasCycle = false; for (int start = 1; start <= n; start++) { if (color[start] != 0) continue; vector stack; stack.push_back(start); color[start] = 1; while (!stack.empty()) { int u = stack.back(); if (it[u] < (int)adj[u].size()) { int v = adj[u][it[u]++]; if (color[v] == 0) { color[v] = 1; stack.push_back(v); } else if (color[v] == 1) hasCycle = true; } else { color[u] = 2; post.push_back(u); stack.pop_back(); } } } if (hasCycle) { cout << -1 << "\n"; return 0; } reverse(post.begin(), post.end()); for (size_t i = 0; i < post.size(); i++) cout << post[i] << (i + 1 < post.size() ? " " : "\n"); return 0; }