#include "coprobber.h"
#include "bits/stdc++.h"
using namespace std;
vector<int> adj[501];
int cur = 0, nig;
int start(int N, bool A[MAX_N][MAX_N]) {
for (int i = 0 ; i < N ; i++) {
for (int j = 0 ; j < N ; j++) {
if (A[i][j]) adj[i].push_back(j);
}
}
return 0;
}
bool check (int c, int p) {
bool res = 0;
for (int i : adj[c]) {
if (i == p) continue;
if (i == nig) return 1;
res |= check(i, c);
}
return res;
}
int nextMove(int R) {
nig = R;
for (int i : adj[cur]) {
if (i == R || check(i, cur)) return cur = i;
}
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
328 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Correct |
57 ms |
1716 KB |
Output is correct |
5 |
Correct |
16 ms |
840 KB |
Output is correct |
6 |
Correct |
53 ms |
1472 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
200 KB |
the situation repeated |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
200 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Incorrect |
1 ms |
200 KB |
the situation repeated |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
200 KB |
Output is correct |
2 |
Correct |
1 ms |
328 KB |
Output is correct |
3 |
Correct |
1 ms |
328 KB |
Output is correct |
4 |
Correct |
57 ms |
1716 KB |
Output is correct |
5 |
Correct |
16 ms |
840 KB |
Output is correct |
6 |
Correct |
53 ms |
1472 KB |
Output is correct |
7 |
Incorrect |
1 ms |
200 KB |
the situation repeated |
8 |
Halted |
0 ms |
0 KB |
- |