#include "coprobber.h"
#include <bits/stdc++.h>
using namespace std;
struct state{
int u, v, t;
int operator()() const {
return u * MAX_N * 2 + v * 2 + t;
}
string print() const {
string r;
r += "(";
r += to_string(u);
r += ", ";
r += to_string(v);
r += ", ";
r += to_string(t);
r += ")";
return r;
}
};
int N;
bool w[MAX_N * MAX_N * 2];
state nxt[MAX_N * MAX_N * 2];
vector<int> G[MAX_N * MAX_N * 2], H[MAX_N * MAX_N * 2];
int deg[MAX_N * MAX_N * 2];
bool added[MAX_N * MAX_N * 2];
int A[MAX_N][MAX_N];
void add_edge(const state& u, const state& v){
// cout << "Edge: " << u.print() << " -> " << v.print() << endl;
G[u()].push_back(v()); if(w[v()] == true) deg[u()]++;
H[v()].push_back(u());
}
int pos = -1;
int start(int N, bool A[MAX_N][MAX_N])
{
::N = N;
for(int i = 0; i < N; i++){
for(int j = 0; j < N; j++){
::A[i][j] = A[i][j];
}
}
for(int u = 0; u < N; u++){
for(int v = 0; v < N; v++){
for(int t = 0; t < 2; t++){
state st {u, v, t};
if(u == v) w[st()] = true;
}
}
}
for(int u = 0; u < N; u++){
for(int v = 0; v < N; v++){
for(int t = 0; t < 2; t++){
state st {u, v, t};
if(u == v) continue;
if(t == 0){
for(int i = 0; i < N; i++){
if(A[u][i] || i == u){
state st2 {i, v, !t};
add_edge(st, st2);
}
}
}else{
for(int i = 0; i < N; i++){
if(A[v][i]){
state st2 {u, i, !t};
add_edge(st, st2);
}
}
}
}
}
}
vector<int> det;
for(int u = 0; u < N; u++){
for(int v = 0; v < N; v++){
for(int t = 0; t < 2; t++){
state st {u, v, t};
bool alr_win = false;
if(t == 0){
for(int i = 0; i < N; i++){
if(A[u][i] && i == v) alr_win = true;
}
}
if(u != v && (G[st()].size() == deg[st()] || alr_win)){
det.push_back(st()); added[st()] = true;
}
}
}
}
while(det.size()){
int k = det.back(); det.pop_back();
int u = k / 2 / MAX_N;
int v = k / 2 % MAX_N;
int t = k % 2;
state st {u, v, t};
if(t == 0){
bool exist_win = false;
for(int i = 0; i < N; i++){
if(A[u][i] || i == u){
state st2 {i, v, !t};
exist_win |= w[st2()];
if(w[st2()]) nxt[st()] = st2;
}
}
w[st()] = exist_win;
}else{
bool all_win = true;
for(int i = 0; i < N; i++){
if(A[v][i]){
state st2 {u, i, !t};
all_win &= w[st2()];
}
}
w[st()] = all_win;
}
for(auto st2 : H[st()]){
if(added[st2]) continue;
deg[st2]++;
if(deg[st2] == G[st2].size()) added[st2] = true, det.push_back(st2);
else if((!t) == 0 && w[st()] == 1) added[st2] = true, det.push_back(st2);
else if((!t) == 1 && w[st()] == 0) added[st2] = true, det.push_back(st2);
}
}
for(int i = 0; i < N; i++){
bool all_win = true;
for(int j = 0; j < N; j++){
state st {i, j, 0};
all_win &= w[st()];
}
if(all_win){
pos = i;
return i;
}
}
return -1;
}
int nextMove(int R)
{
state st {pos, R, 0};
state st2 = nxt[st()];
pos = st2.u;
return pos;
}
Compilation message
coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:92:46: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
92 | if(u != v && (G[st()].size() == deg[st()] || alr_win)){
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~
coprobber.cpp:129:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
129 | if(deg[st2] == G[st2].size()) added[st2] = true, det.push_back(st2);
| ~~~~~~~~~^~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
23760 KB |
Output is correct |
2 |
Correct |
12 ms |
23824 KB |
Output is correct |
3 |
Correct |
11 ms |
23888 KB |
Output is correct |
4 |
Correct |
652 ms |
66236 KB |
Output is correct |
5 |
Correct |
115 ms |
35828 KB |
Output is correct |
6 |
Correct |
961 ms |
67844 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
13 ms |
23876 KB |
Output is correct |
2 |
Correct |
11 ms |
23908 KB |
Output is correct |
3 |
Correct |
666 ms |
71396 KB |
Output is correct |
4 |
Correct |
906 ms |
66188 KB |
Output is correct |
5 |
Correct |
925 ms |
69792 KB |
Output is correct |
6 |
Correct |
686 ms |
68380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
23804 KB |
Output is correct |
2 |
Correct |
14 ms |
23876 KB |
Output is correct |
3 |
Correct |
10 ms |
23888 KB |
Output is correct |
4 |
Correct |
11 ms |
23760 KB |
Output is correct |
5 |
Correct |
12 ms |
23888 KB |
Output is correct |
6 |
Correct |
12 ms |
23864 KB |
Output is correct |
7 |
Correct |
12 ms |
23924 KB |
Output is correct |
8 |
Correct |
11 ms |
23948 KB |
Output is correct |
9 |
Correct |
12 ms |
24192 KB |
Output is correct |
10 |
Correct |
25 ms |
27232 KB |
Output is correct |
11 |
Correct |
49 ms |
36372 KB |
Output is correct |
12 |
Correct |
17 ms |
24272 KB |
Output is correct |
13 |
Correct |
16 ms |
25624 KB |
Output is correct |
14 |
Correct |
33 ms |
30228 KB |
Output is correct |
15 |
Correct |
21 ms |
25296 KB |
Output is correct |
16 |
Correct |
15 ms |
25680 KB |
Output is correct |
17 |
Correct |
52 ms |
38560 KB |
Output is correct |
18 |
Correct |
23 ms |
26208 KB |
Output is correct |
19 |
Correct |
12 ms |
23760 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
11 ms |
23760 KB |
Output is correct |
2 |
Correct |
12 ms |
23824 KB |
Output is correct |
3 |
Correct |
11 ms |
23888 KB |
Output is correct |
4 |
Correct |
652 ms |
66236 KB |
Output is correct |
5 |
Correct |
115 ms |
35828 KB |
Output is correct |
6 |
Correct |
961 ms |
67844 KB |
Output is correct |
7 |
Correct |
13 ms |
23876 KB |
Output is correct |
8 |
Correct |
11 ms |
23908 KB |
Output is correct |
9 |
Correct |
666 ms |
71396 KB |
Output is correct |
10 |
Correct |
906 ms |
66188 KB |
Output is correct |
11 |
Correct |
925 ms |
69792 KB |
Output is correct |
12 |
Correct |
686 ms |
68380 KB |
Output is correct |
13 |
Correct |
10 ms |
23804 KB |
Output is correct |
14 |
Correct |
14 ms |
23876 KB |
Output is correct |
15 |
Correct |
10 ms |
23888 KB |
Output is correct |
16 |
Correct |
11 ms |
23760 KB |
Output is correct |
17 |
Correct |
12 ms |
23888 KB |
Output is correct |
18 |
Correct |
12 ms |
23864 KB |
Output is correct |
19 |
Correct |
12 ms |
23924 KB |
Output is correct |
20 |
Correct |
11 ms |
23948 KB |
Output is correct |
21 |
Correct |
12 ms |
24192 KB |
Output is correct |
22 |
Correct |
25 ms |
27232 KB |
Output is correct |
23 |
Correct |
49 ms |
36372 KB |
Output is correct |
24 |
Correct |
17 ms |
24272 KB |
Output is correct |
25 |
Correct |
16 ms |
25624 KB |
Output is correct |
26 |
Correct |
33 ms |
30228 KB |
Output is correct |
27 |
Correct |
21 ms |
25296 KB |
Output is correct |
28 |
Correct |
15 ms |
25680 KB |
Output is correct |
29 |
Correct |
52 ms |
38560 KB |
Output is correct |
30 |
Correct |
23 ms |
26208 KB |
Output is correct |
31 |
Correct |
12 ms |
23760 KB |
Output is correct |
32 |
Correct |
12 ms |
23760 KB |
Output is correct |
33 |
Correct |
13 ms |
23760 KB |
Output is correct |
34 |
Correct |
11 ms |
23940 KB |
Output is correct |
35 |
Correct |
628 ms |
66312 KB |
Output is correct |
36 |
Correct |
116 ms |
35856 KB |
Output is correct |
37 |
Correct |
761 ms |
67768 KB |
Output is correct |
38 |
Correct |
12 ms |
23760 KB |
Output is correct |
39 |
Correct |
14 ms |
24016 KB |
Output is correct |
40 |
Correct |
751 ms |
71300 KB |
Output is correct |
41 |
Correct |
675 ms |
66276 KB |
Output is correct |
42 |
Correct |
672 ms |
69800 KB |
Output is correct |
43 |
Correct |
700 ms |
68476 KB |
Output is correct |
44 |
Correct |
11 ms |
23760 KB |
Output is correct |
45 |
Correct |
12 ms |
23900 KB |
Output is correct |
46 |
Correct |
12 ms |
23888 KB |
Output is correct |
47 |
Correct |
14 ms |
24144 KB |
Output is correct |
48 |
Correct |
24 ms |
27316 KB |
Output is correct |
49 |
Correct |
50 ms |
36468 KB |
Output is correct |
50 |
Correct |
13 ms |
24272 KB |
Output is correct |
51 |
Correct |
20 ms |
25552 KB |
Output is correct |
52 |
Correct |
34 ms |
30140 KB |
Output is correct |
53 |
Correct |
15 ms |
25168 KB |
Output is correct |
54 |
Correct |
17 ms |
25680 KB |
Output is correct |
55 |
Correct |
54 ms |
38536 KB |
Output is correct |
56 |
Correct |
23 ms |
26256 KB |
Output is correct |
57 |
Correct |
72 ms |
36176 KB |
Output is correct |
58 |
Correct |
304 ms |
57864 KB |
Output is correct |
59 |
Correct |
859 ms |
109036 KB |
Output is correct |
60 |
Runtime error |
1115 ms |
262144 KB |
Execution killed with signal 9 |
61 |
Halted |
0 ms |
0 KB |
- |