#include <bits/stdc++.h> using namespace std; const int MAXN = 500 * 1000; vector<int> graph[MAXN], rev_graph[MAXN]; int color[MAXN]; vector<int> ordering; int scc[MAXN], scc_size[MAXN]; int only_scc; int in[MAXN]; int dfs_result[MAXN]; //int has_back[MAXN]; int has_back2[MAXN]; int dfs_time; int left_branch; int min_back, max_back; vector<pair<int, int>> loops; bool answer_is_0; void rev_dfs(int u) { if (color[u]) return; color[u] = 1; for (int v : rev_graph[u]) rev_dfs(v); ordering.push_back(u); } void dfs(int u, int scc_num) { if (color[u]) return; color[u] = 1; scc[u] = scc_num; for (int v : graph[u]) dfs(v, scc_num); } void dfs2(int u) { color[u] = 1; in[u] = dfs_time++; dfs_result[u] = 0; //has_back[u] = true; has_back2[u] = MAXN; for (int v : graph[u]) { if (scc[v] != only_scc) continue; if (!color[v]) { dfs2(v); if (in[v] >= left_branch) { dfs_result[u] = max(dfs_result[u], dfs_result[v]); // has_back[u] = min(has_back[u], has_back[v]); has_back2[u] = min(has_back2[u], has_back2[v]); } } else { if (color[v] == 1) // powrotna if (in[v] < left_branch || left_branch == -1) { has_back2[u] = min(has_back2[u], in[v]); // has_back[u] = false; max_back = max(max_back, in[v]); } else { answer_is_0 = true; } if (color[v] == 2) { if (in[v] < left_branch) dfs_result[u] = max(dfs_result[u], in[v]); else { dfs_result[u] = max(dfs_result[u], dfs_result[v]); has_back2[u] = min(has_back2[u], has_back2[v]); } } } } if (has_back2[u] <= in[u]) min_back = min(min_back, in[u]); // if (has_back[u] == 0) // min_back = min(min_back, in[u]); if (left_branch == -1) left_branch = dfs_time; color[u] = 2; if (in[u] < left_branch && dfs_result[u] > in[u]) loops.emplace_back(in[u], dfs_result[u]); } int main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; --a; --b; graph[a].push_back(b); rev_graph[b].push_back(a); } fill_n(color, n, 0); for (int i = 0; i < n; ++i) rev_dfs(i); reverse(ordering.begin(), ordering.end()); fill_n(color, n, 0); for (int u : ordering) dfs(u, u); // for (int i =0 ;i<n;++i) cerr << i << " " << scc[i] << endl; fill_n(scc_size, n, 0); for (int i = 0; i < n; ++i) scc_size[scc[i]]++; int count2 = 0; for (int i = 0; i < n; ++i) if (scc_size[i] >= 2) ++count2; if (count2 == 0) { cout << "NIE" << endl; return 0; } if (count2 >= 2) { cout << 0 << endl; cout << endl; return 0; } for (int i = 0; i < n; ++i) if (scc_size[i] >= 2) only_scc = i; dfs_time = 0; left_branch = -1; min_back = n - 1; max_back = 0; fill_n(color, n, 0); answer_is_0 = false; dfs2(only_scc); /* for (int i = 0; i < n; ++i) if (scc[i] == only_scc && i < 100) cerr << "in[" << i <<"] = " << in[i]<<endl; cerr <<"lb = " << left_branch << endl; cerr << "min_back = " << min_back << endl; cerr << "max_back = " << max_back << endl; cerr << "loops:" << endl; for (auto i : loops) cerr << i.first << " " <<i.second << endl; //*/ if (answer_is_0) { cout << 0 << endl; cout << endl; return 0; } vector<int> counting(left_branch); for (pair<int, int> loop : loops) { counting[loop.first + 1]++; counting[loop.second]--; } if (min_back < left_branch - 1) counting[min_back + 1]++; counting[0]++; counting[max_back]--; int sum = 0; vector<bool> ok(left_branch); for (int i = 0; i < left_branch; ++i) { sum += counting[i]; if (sum == 0) ok[i] = true; else ok[i] = false; } vector<int> solution; for (int i = 0; i < n; ++i) if (scc[i] == only_scc && in[i] < left_branch && ok[in[i]]) solution.push_back(i); cout << solution.size() << endl; for (int i = 0; i < solution.size(); ++i) { if (i > 0) cout << " "; cout << 1 + solution[i]; } cout << endl; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 | #include <bits/stdc++.h> using namespace std; const int MAXN = 500 * 1000; vector<int> graph[MAXN], rev_graph[MAXN]; int color[MAXN]; vector<int> ordering; int scc[MAXN], scc_size[MAXN]; int only_scc; int in[MAXN]; int dfs_result[MAXN]; //int has_back[MAXN]; int has_back2[MAXN]; int dfs_time; int left_branch; int min_back, max_back; vector<pair<int, int>> loops; bool answer_is_0; void rev_dfs(int u) { if (color[u]) return; color[u] = 1; for (int v : rev_graph[u]) rev_dfs(v); ordering.push_back(u); } void dfs(int u, int scc_num) { if (color[u]) return; color[u] = 1; scc[u] = scc_num; for (int v : graph[u]) dfs(v, scc_num); } void dfs2(int u) { color[u] = 1; in[u] = dfs_time++; dfs_result[u] = 0; //has_back[u] = true; has_back2[u] = MAXN; for (int v : graph[u]) { if (scc[v] != only_scc) continue; if (!color[v]) { dfs2(v); if (in[v] >= left_branch) { dfs_result[u] = max(dfs_result[u], dfs_result[v]); // has_back[u] = min(has_back[u], has_back[v]); has_back2[u] = min(has_back2[u], has_back2[v]); } } else { if (color[v] == 1) // powrotna if (in[v] < left_branch || left_branch == -1) { has_back2[u] = min(has_back2[u], in[v]); // has_back[u] = false; max_back = max(max_back, in[v]); } else { answer_is_0 = true; } if (color[v] == 2) { if (in[v] < left_branch) dfs_result[u] = max(dfs_result[u], in[v]); else { dfs_result[u] = max(dfs_result[u], dfs_result[v]); has_back2[u] = min(has_back2[u], has_back2[v]); } } } } if (has_back2[u] <= in[u]) min_back = min(min_back, in[u]); // if (has_back[u] == 0) // min_back = min(min_back, in[u]); if (left_branch == -1) left_branch = dfs_time; color[u] = 2; if (in[u] < left_branch && dfs_result[u] > in[u]) loops.emplace_back(in[u], dfs_result[u]); } int main() { ios_base::sync_with_stdio(false); int n, m; cin >> n >> m; for (int i = 0; i < m; ++i) { int a, b; cin >> a >> b; --a; --b; graph[a].push_back(b); rev_graph[b].push_back(a); } fill_n(color, n, 0); for (int i = 0; i < n; ++i) rev_dfs(i); reverse(ordering.begin(), ordering.end()); fill_n(color, n, 0); for (int u : ordering) dfs(u, u); // for (int i =0 ;i<n;++i) cerr << i << " " << scc[i] << endl; fill_n(scc_size, n, 0); for (int i = 0; i < n; ++i) scc_size[scc[i]]++; int count2 = 0; for (int i = 0; i < n; ++i) if (scc_size[i] >= 2) ++count2; if (count2 == 0) { cout << "NIE" << endl; return 0; } if (count2 >= 2) { cout << 0 << endl; cout << endl; return 0; } for (int i = 0; i < n; ++i) if (scc_size[i] >= 2) only_scc = i; dfs_time = 0; left_branch = -1; min_back = n - 1; max_back = 0; fill_n(color, n, 0); answer_is_0 = false; dfs2(only_scc); /* for (int i = 0; i < n; ++i) if (scc[i] == only_scc && i < 100) cerr << "in[" << i <<"] = " << in[i]<<endl; cerr <<"lb = " << left_branch << endl; cerr << "min_back = " << min_back << endl; cerr << "max_back = " << max_back << endl; cerr << "loops:" << endl; for (auto i : loops) cerr << i.first << " " <<i.second << endl; //*/ if (answer_is_0) { cout << 0 << endl; cout << endl; return 0; } vector<int> counting(left_branch); for (pair<int, int> loop : loops) { counting[loop.first + 1]++; counting[loop.second]--; } if (min_back < left_branch - 1) counting[min_back + 1]++; counting[0]++; counting[max_back]--; int sum = 0; vector<bool> ok(left_branch); for (int i = 0; i < left_branch; ++i) { sum += counting[i]; if (sum == 0) ok[i] = true; else ok[i] = false; } vector<int> solution; for (int i = 0; i < n; ++i) if (scc[i] == only_scc && in[i] < left_branch && ok[in[i]]) solution.push_back(i); cout << solution.size() << endl; for (int i = 0; i < solution.size(); ++i) { if (i > 0) cout << " "; cout << 1 + solution[i]; } cout << endl; } |