#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN=500;
int n, as[mxN][mxN], aws[mxN][mxN], qh, qt, p, f[mxN][mxN];
bool w[mxN][mxN][2];
array<int, 3> qu[mxN*mxN*2];
int start(int n2, bool a[mxN][mxN]) {
n=n2;
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[i][u[0]]||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[i][u[1]]&&!w[u[0]][i][1]&&++aws[u[0]][i]>=as[u[0]][i]) {
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 |
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 |
389 ms |
11128 KB |
Output is correct |
5 |
Correct |
62 ms |
3960 KB |
Output is correct |
6 |
Correct |
448 ms |
11000 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
384 KB |
Output is correct |
2 |
Correct |
2 ms |
512 KB |
Output is correct |
3 |
Correct |
383 ms |
10780 KB |
Output is correct |
4 |
Correct |
382 ms |
11128 KB |
Output is correct |
5 |
Correct |
381 ms |
10488 KB |
Output is correct |
6 |
Correct |
396 ms |
10872 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 |
512 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 |
2 ms |
512 KB |
Output is correct |
10 |
Correct |
4 ms |
1152 KB |
Output is correct |
11 |
Correct |
6 ms |
1152 KB |
Output is correct |
12 |
Correct |
2 ms |
640 KB |
Output is correct |
13 |
Correct |
4 ms |
1024 KB |
Output is correct |
14 |
Correct |
5 ms |
1152 KB |
Output is correct |
15 |
Correct |
3 ms |
896 KB |
Output is correct |
16 |
Correct |
3 ms |
896 KB |
Output is correct |
17 |
Correct |
9 ms |
1536 KB |
Output is correct |
18 |
Correct |
4 ms |
1024 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 |
512 KB |
Output is correct |
4 |
Correct |
377 ms |
11128 KB |
Output is correct |
5 |
Correct |
53 ms |
3960 KB |
Output is correct |
6 |
Correct |
448 ms |
10972 KB |
Output is correct |
7 |
Correct |
2 ms |
384 KB |
Output is correct |
8 |
Correct |
2 ms |
512 KB |
Output is correct |
9 |
Correct |
383 ms |
10804 KB |
Output is correct |
10 |
Correct |
412 ms |
11144 KB |
Output is correct |
11 |
Correct |
371 ms |
10456 KB |
Output is correct |
12 |
Correct |
435 ms |
11004 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
2 ms |
384 KB |
Output is correct |
15 |
Correct |
2 ms |
512 KB |
Output is correct |
16 |
Correct |
2 ms |
512 KB |
Output is correct |
17 |
Correct |
4 ms |
1152 KB |
Output is correct |
18 |
Correct |
5 ms |
1152 KB |
Output is correct |
19 |
Correct |
2 ms |
640 KB |
Output is correct |
20 |
Correct |
3 ms |
896 KB |
Output is correct |
21 |
Correct |
6 ms |
1152 KB |
Output is correct |
22 |
Correct |
3 ms |
896 KB |
Output is correct |
23 |
Correct |
3 ms |
896 KB |
Output is correct |
24 |
Correct |
9 ms |
1536 KB |
Output is correct |
25 |
Correct |
4 ms |
1152 KB |
Output is correct |
26 |
Correct |
12 ms |
1920 KB |
Output is correct |
27 |
Correct |
60 ms |
3320 KB |
Output is correct |
28 |
Correct |
114 ms |
4092 KB |
Output is correct |
29 |
Correct |
583 ms |
10872 KB |
Output is correct |
30 |
Correct |
159 ms |
4600 KB |
Output is correct |
31 |
Correct |
199 ms |
4828 KB |
Output is correct |
32 |
Correct |
585 ms |
11040 KB |
Output is correct |
33 |
Correct |
207 ms |
5240 KB |
Output is correct |
34 |
Correct |
682 ms |
10852 KB |
Output is correct |
35 |
Correct |
416 ms |
10104 KB |
Output is correct |
36 |
Correct |
707 ms |
11012 KB |
Output is correct |
37 |
Correct |
377 ms |
6648 KB |
Output is correct |
38 |
Correct |
2 ms |
384 KB |
Output is correct |