// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define pb push_back
#define sz(x) int(x.size())
template<class T> using V = vector<T>;
using vi = V<int>;
int main() {
cin.tie(0)->sync_with_stdio(0);
int N, M; cin >> N >> M;
V<vi> adj(N), radj(N); vi out(N), dead(N);
set<int> left; for(int i = 0; i < N; i++) left.insert(i);
vi q;
auto rem = [&](int u) {
left.erase(u);
for(auto& v : radj[u]) if (!dead[v]) {
out[v]--;
if (out[v] == 0) q.pb(v);
}
};
for(int i = 0; i < M; i++) {
int u, v; cin >> u >> v; --u, --v;
adj[u].pb(v);
radj[v].pb(u); out[u]++;
}
for(int i = 0; i < N; i++) if (out[i] == 0) q.pb(i);
vi ans;
while(sz(left)) {
int u;
if (sz(q)) {
u = q.back(); q.pop_back();
} else u = *begin(left);
// cout << u << endl;
dead[u] = 1;
for(auto& v : radj[u]) dead[v] = 1;
rem(u); ans.pb(u);
for(auto& v : radj[u]) rem(v);
}
cout << sz(ans) << nl;
for(auto& x : ans) cout << x + 1 << " ";
cout << nl;
exit(0-0);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
233 ms |
86760 KB |
Output is correct |
2 |
Correct |
239 ms |
86100 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
168 ms |
54356 KB |
Output is correct |
5 |
Correct |
213 ms |
72644 KB |
Output is correct |
6 |
Correct |
250 ms |
72828 KB |
Output is correct |
7 |
Correct |
205 ms |
72388 KB |
Output is correct |
8 |
Execution timed out |
3024 ms |
70492 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
247 ms |
86672 KB |
Output is correct |
2 |
Correct |
276 ms |
74048 KB |
Output is correct |
3 |
Correct |
185 ms |
68992 KB |
Output is correct |
4 |
Incorrect |
667 ms |
78884 KB |
There must not be two people within the committee such that one person dislikes the other. |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1112 KB |
Output is correct |
2 |
Correct |
2 ms |
1112 KB |
Output is correct |
3 |
Correct |
2 ms |
1116 KB |
Output is correct |
4 |
Incorrect |
3 ms |
1116 KB |
There must not be two people within the committee such that one person dislikes the other. |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
233 ms |
86760 KB |
Output is correct |
2 |
Correct |
239 ms |
86100 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
168 ms |
54356 KB |
Output is correct |
5 |
Correct |
213 ms |
72644 KB |
Output is correct |
6 |
Correct |
250 ms |
72828 KB |
Output is correct |
7 |
Correct |
205 ms |
72388 KB |
Output is correct |
8 |
Execution timed out |
3024 ms |
70492 KB |
Time limit exceeded |
9 |
Halted |
0 ms |
0 KB |
- |