/*
- 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];
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
357 ms |
10232 KB |
Output is correct |
| 5 |
Correct |
53 ms |
3448 KB |
Output is correct |
| 6 |
Correct |
382 ms |
9948 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| 3 |
Correct |
365 ms |
9948 KB |
Output is correct |
| 4 |
Correct |
361 ms |
10160 KB |
Output is correct |
| 5 |
Correct |
388 ms |
9556 KB |
Output is correct |
| 6 |
Correct |
378 ms |
9948 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
512 KB |
Output is correct |
| 9 |
Correct |
3 ms |
512 KB |
Output is correct |
| 10 |
Correct |
4 ms |
896 KB |
Output is correct |
| 11 |
Correct |
6 ms |
1024 KB |
Output is correct |
| 12 |
Correct |
2 ms |
512 KB |
Output is correct |
| 13 |
Correct |
3 ms |
768 KB |
Output is correct |
| 14 |
Correct |
6 ms |
1024 KB |
Output is correct |
| 15 |
Correct |
3 ms |
768 KB |
Output is correct |
| 16 |
Correct |
4 ms |
768 KB |
Output is correct |
| 17 |
Correct |
11 ms |
1280 KB |
Output is correct |
| 18 |
Correct |
3 ms |
896 KB |
Output is correct |
| 19 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
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 |
368 ms |
10252 KB |
Output is correct |
| 5 |
Correct |
53 ms |
3448 KB |
Output is correct |
| 6 |
Correct |
395 ms |
9976 KB |
Output is correct |
| 7 |
Correct |
2 ms |
384 KB |
Output is correct |
| 8 |
Correct |
2 ms |
384 KB |
Output is correct |
| 9 |
Correct |
364 ms |
9920 KB |
Output is correct |
| 10 |
Correct |
358 ms |
10232 KB |
Output is correct |
| 11 |
Correct |
352 ms |
9464 KB |
Output is correct |
| 12 |
Correct |
365 ms |
10076 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 |
4 ms |
1024 KB |
Output is correct |
| 18 |
Correct |
5 ms |
896 KB |
Output is correct |
| 19 |
Correct |
2 ms |
512 KB |
Output is correct |
| 20 |
Correct |
3 ms |
768 KB |
Output is correct |
| 21 |
Correct |
6 ms |
1024 KB |
Output is correct |
| 22 |
Correct |
3 ms |
768 KB |
Output is correct |
| 23 |
Correct |
3 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 |
12 ms |
1536 KB |
Output is correct |
| 27 |
Correct |
61 ms |
2504 KB |
Output is correct |
| 28 |
Correct |
111 ms |
3064 KB |
Output is correct |
| 29 |
Correct |
502 ms |
9852 KB |
Output is correct |
| 30 |
Correct |
235 ms |
3708 KB |
Output is correct |
| 31 |
Correct |
232 ms |
3960 KB |
Output is correct |
| 32 |
Correct |
763 ms |
10056 KB |
Output is correct |
| 33 |
Correct |
209 ms |
4264 KB |
Output is correct |
| 34 |
Correct |
1038 ms |
9976 KB |
Output is correct |
| 35 |
Correct |
366 ms |
9208 KB |
Output is correct |
| 36 |
Correct |
938 ms |
10204 KB |
Output is correct |
| 37 |
Correct |
356 ms |
5724 KB |
Output is correct |
| 38 |
Correct |
2 ms |
384 KB |
Output is correct |
