#include <bits/stdc++.h>
using namespace std;
#define MAXK 500005
#define pb push_back
#define sz(v) ((int)(v).size())
static int N, K, cop_pos;
static int num[501][501][2], deg[MAXK];
static int C[MAXK], R[MAXK], T[MAXK], F[MAXK];
static bool w[501][501], V[MAXK];
inline int get_dp(int c, int r, int t)
{
int n = num[c][r][t];
if (!V[n]) return 0;
if (!t) return C[F[n]];
return 1;
}
int start(int n, bool A[500][500])
{
N = n;
for (int i=1;i<=N;i++) for (int j=1;j<=N;j++) w[i][j] = A[i-1][j-1];
for (int i=1;i<=N;i++) for (int j=1;j<=N;j++) for (int k=0;k<2;k++){
num[i][j][k] = ++K;
C[K] = i, R[K] = j, T[K] = k;
}
vector <int> _deg_(N+1, 0);
for (int i=1;i<=N;i++) for (int j=1;j<=N;j++) if (w[i][j]) _deg_[i]++;
for (int i=1;i<=N;i++) for (int j=1;j<=N;j++) if (i != j){
deg[num[i][j][1]] = _deg_[j];
}
queue <int> que;
for (int i=1;i<=N;i++){
V[num[i][i][0]] = 1, que.push(num[i][i][0]);
V[num[i][i][1]] = 1, que.push(num[i][i][1]);
}
while (!que.empty()){
int q = que.front(); que.pop();
int c = C[q], r = R[q], t = T[q];
if (t){
for (int i=1;i<=N;i++) if (c == i || w[i][c]){
int m = num[i][r][0];
if (!V[m]) V[m] = 1, F[m] = q, que.push(m);
}
}else{
for (int i=1;i<=N;i++) if (w[i][r]){
int m = num[c][i][1];
if (!--deg[m]) V[m] = 1, que.push(m);
}
}
}
for (int i=1;i<=N;i++){
bool sw = 0;
for (int j=1;j<=N;j++) if (!get_dp(i, j, 1)){ sw = 1; break; }
if (sw) continue;
cop_pos = i;
return i-1;
}
return -1;
}
int nextMove(int x)
{
++x;
int to = get_dp(cop_pos, x, 0);
cop_pos = to;
return to-1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
512 KB |
Output is correct |
| 4 |
Correct |
294 ms |
14204 KB |
Output is correct |
| 5 |
Correct |
50 ms |
4500 KB |
Output is correct |
| 6 |
Correct |
458 ms |
14224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
512 KB |
Output is correct |
| 3 |
Correct |
323 ms |
13896 KB |
Output is correct |
| 4 |
Correct |
289 ms |
14204 KB |
Output is correct |
| 5 |
Correct |
325 ms |
13508 KB |
Output is correct |
| 6 |
Correct |
357 ms |
14012 KB |
Output is correct |
| # |
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 |
2 ms |
384 KB |
Output is correct |
| 5 |
Correct |
2 ms |
512 KB |
Output is correct |
| 6 |
Correct |
2 ms |
384 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
2 ms |
512 KB |
Output is correct |
| 10 |
Correct |
3 ms |
1280 KB |
Output is correct |
| 11 |
Correct |
5 ms |
1280 KB |
Output is correct |
| 12 |
Correct |
2 ms |
512 KB |
Output is correct |
| 13 |
Correct |
3 ms |
1024 KB |
Output is correct |
| 14 |
Correct |
5 ms |
1280 KB |
Output is correct |
| 15 |
Correct |
3 ms |
768 KB |
Output is correct |
| 16 |
Correct |
3 ms |
896 KB |
Output is correct |
| 17 |
Correct |
8 ms |
1536 KB |
Output is correct |
| 18 |
Correct |
3 ms |
1280 KB |
Output is correct |
| 19 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
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 |
306 ms |
14208 KB |
Output is correct |
| 5 |
Correct |
62 ms |
4500 KB |
Output is correct |
| 6 |
Correct |
486 ms |
14260 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
8 ms |
512 KB |
Output is correct |
| 9 |
Correct |
344 ms |
13832 KB |
Output is correct |
| 10 |
Correct |
293 ms |
14204 KB |
Output is correct |
| 11 |
Correct |
335 ms |
13528 KB |
Output is correct |
| 12 |
Correct |
355 ms |
14016 KB |
Output is correct |
| 13 |
Correct |
2 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
384 KB |
Output is correct |
| 15 |
Correct |
2 ms |
384 KB |
Output is correct |
| 16 |
Correct |
2 ms |
512 KB |
Output is correct |
| 17 |
Correct |
3 ms |
1280 KB |
Output is correct |
| 18 |
Correct |
5 ms |
1280 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
3 ms |
1024 KB |
Output is correct |
| 21 |
Correct |
5 ms |
1280 KB |
Output is correct |
| 22 |
Correct |
3 ms |
768 KB |
Output is correct |
| 23 |
Correct |
3 ms |
768 KB |
Output is correct |
| 24 |
Correct |
9 ms |
1536 KB |
Output is correct |
| 25 |
Correct |
3 ms |
1280 KB |
Output is correct |
| 26 |
Correct |
7 ms |
2944 KB |
Output is correct |
| 27 |
Correct |
21 ms |
8876 KB |
Output is correct |
| 28 |
Correct |
41 ms |
13176 KB |
Output is correct |
| 29 |
Correct |
679 ms |
15244 KB |
Output is correct |
| 30 |
Correct |
85 ms |
11128 KB |
Output is correct |
| 31 |
Correct |
93 ms |
13304 KB |
Output is correct |
| 32 |
Correct |
590 ms |
14732 KB |
Output is correct |
| 33 |
Correct |
122 ms |
13192 KB |
Output is correct |
| 34 |
Correct |
742 ms |
15044 KB |
Output is correct |
| 35 |
Correct |
765 ms |
13272 KB |
Output is correct |
| 36 |
Correct |
860 ms |
14684 KB |
Output is correct |
| 37 |
Correct |
339 ms |
13212 KB |
Output is correct |
| 38 |
Correct |
2 ms |
384 KB |
Output is correct |
