#include "coprobber.h"
#include <vector>
int pre[MAX_N], pos[MAX_N], t = 0;
int prev[MAX_N];
std::vector<int> g[MAX_N];
void dfs(int cur) {
pre[cur] = t++;
for (int nx : g[cur]) {
if (nx != prev[cur]) {
prev[nx] = cur;
dfs(nx);
}
}
pos[cur] = t++;
}
int start(int N, bool A[MAX_N][MAX_N]) {
for (int i = 0; i < N; i++) {
for (int k = 0; k < N; k++) {
if (A[i][k]) {
g[i].push_back(k);
}
}
}
dfs(0);
return 0;
}
int x = 0;
int nextMove(int R) {
for (int nx : g[x]) {
if (nx != prev[x]) {
if (pre[nx] <= pre[R] && pos[nx] >= pos[R]) {
return x = nx;
}
}
}
return x;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Correct |
43 ms |
1804 KB |
Output is correct |
5 |
Correct |
12 ms |
1024 KB |
Output is correct |
6 |
Correct |
44 ms |
1656 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
222 ms |
262144 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
384 KB |
Output is correct |
4 |
Runtime error |
232 ms |
262144 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
284 KB |
Output is correct |
4 |
Correct |
43 ms |
1756 KB |
Output is correct |
5 |
Correct |
12 ms |
1024 KB |
Output is correct |
6 |
Correct |
43 ms |
1656 KB |
Output is correct |
7 |
Runtime error |
222 ms |
262144 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
8 |
Halted |
0 ms |
0 KB |
- |