/*
- Call a state winning if the cop will win
- A state when it is the cop's turn is winning if any states that it directs to are winning
- A state when it is the robber's turn is winning if all states that it directs to are winning
- Use a variation of topological sort to mark states as winning from the "leaf" states
- If one of the starting positions for the cop works, then all starting positions work, so we only need to check node 0
*/
#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN=500;
int as[mxN][mxN], qh, qt, p, f[mxN][mxN];
bool w[mxN][mxN][2];
array<int, 3> qu[mxN*mxN*2];
int start(int n, bool a[mxN][mxN]) {
for(int i=0; i<n; ++i)
for(int j=0; j<n; ++j)
for(int k=0; k<n; ++k)
as[k][i]+=a[i][j];
qh=qt=0;
for(int i=0; i<n; ++i) {
for(int j=0; j<2; ++j) {
w[i][i][j]=1;
qu[qt++]={i, i, j};
}
}
while(qh<qt) {
array<int, 3> u=qu[qh++];
for(int i=0; i<n; ++i) {
if(u[2]&&(a[u[0]][i]||i==u[0])&&!w[i][u[1]][0]) {
w[i][u[1]][0]=1;
qu[qt++]={i, u[1], 0};
f[i][u[1]]=u[0];
} else if(!u[2]&&a[u[1]][i]&&!w[u[0]][i][1]&&--as[u[0]][i]==0) {
w[u[0]][i][1]=1;
qu[qt++]={u[0], i, 1};
}
}
}
p=0;
bool ok=1;
for(int i=0; i<n&&ok; ++i)
ok=w[0][i][0];
return ok?0:-1;
}
int nextMove(int r) {
return p=f[p][r];
}
# |
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 |
512 KB |
Output is correct |
4 |
Correct |
370 ms |
10232 KB |
Output is correct |
5 |
Correct |
54 ms |
3448 KB |
Output is correct |
6 |
Correct |
451 ms |
9948 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 |
476 ms |
9848 KB |
Output is correct |
4 |
Correct |
365 ms |
10116 KB |
Output is correct |
5 |
Correct |
358 ms |
9592 KB |
Output is correct |
6 |
Correct |
371 ms |
9924 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 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 |
4 ms |
896 KB |
Output is correct |
11 |
Correct |
5 ms |
1024 KB |
Output is correct |
12 |
Correct |
2 ms |
512 KB |
Output is correct |
13 |
Correct |
4 ms |
768 KB |
Output is correct |
14 |
Correct |
6 ms |
1152 KB |
Output is correct |
15 |
Correct |
3 ms |
768 KB |
Output is correct |
16 |
Correct |
4 ms |
768 KB |
Output is correct |
17 |
Correct |
10 ms |
1280 KB |
Output is correct |
18 |
Correct |
4 ms |
896 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 |
421 ms |
10372 KB |
Output is correct |
5 |
Correct |
51 ms |
3448 KB |
Output is correct |
6 |
Correct |
517 ms |
9964 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
377 ms |
9848 KB |
Output is correct |
10 |
Correct |
435 ms |
10104 KB |
Output is correct |
11 |
Correct |
369 ms |
9540 KB |
Output is correct |
12 |
Correct |
382 ms |
9976 KB |
Output is correct |
13 |
Correct |
0 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 |
4 ms |
896 KB |
Output is correct |
18 |
Correct |
5 ms |
1024 KB |
Output is correct |
19 |
Correct |
2 ms |
512 KB |
Output is correct |
20 |
Correct |
3 ms |
768 KB |
Output is correct |
21 |
Correct |
5 ms |
1024 KB |
Output is correct |
22 |
Correct |
3 ms |
768 KB |
Output is correct |
23 |
Correct |
4 ms |
768 KB |
Output is correct |
24 |
Correct |
11 ms |
1408 KB |
Output is correct |
25 |
Correct |
4 ms |
896 KB |
Output is correct |
26 |
Correct |
13 ms |
1536 KB |
Output is correct |
27 |
Correct |
64 ms |
2552 KB |
Output is correct |
28 |
Correct |
114 ms |
3064 KB |
Output is correct |
29 |
Correct |
489 ms |
9928 KB |
Output is correct |
30 |
Correct |
231 ms |
3784 KB |
Output is correct |
31 |
Correct |
222 ms |
3960 KB |
Output is correct |
32 |
Correct |
680 ms |
10208 KB |
Output is correct |
33 |
Correct |
194 ms |
4216 KB |
Output is correct |
34 |
Correct |
1002 ms |
9948 KB |
Output is correct |
35 |
Correct |
369 ms |
9208 KB |
Output is correct |
36 |
Correct |
899 ms |
10136 KB |
Output is correct |
37 |
Correct |
347 ms |
5880 KB |
Output is correct |
38 |
Correct |
2 ms |
384 KB |
Output is correct |