Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int n, m;
- vector<int> used;
- vector<vector<int>> g;
- vector<int> ans;
- void dfs(int v, int parent){
- used[v] = 1;
- for (auto &i : g[v]){
- if (used[i] == 1){
- cout << "No";
- exit(0);
- }
- if (used[i] == 0){
- dfs(i, v);
- }
- }
- used[v] = 2;
- ans.push_back(v);
- }
- int main() {
- cin >> n >> m;
- used.resize(n);
- g.resize(n);
- for (int i = 0; i < m; i++){
- int fr, to;
- cin >> fr >> to;
- fr--; to--;
- g[fr].emplace_back(to);
- }
- for (int i = 0; i < n; i++){
- if (!used[i]){
- dfs(i, -1);
- }
- }
- cout << "Yes\n";
- for (int i = 0; i < n; i++){
- cout << ans[n - 1 - i] + 1 << ' ';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement