#include "coprobber.h"
#include <iostream>
#include <queue>
#include <cassert>
#include <bitset>
#include <vector>
using namespace std;
bitset<MAX_N> edg[MAX_N];
bitset<MAX_N> redg[MAX_N];
bitset<MAX_N> used[2][MAX_N];
int depth[2][MAX_N][MAX_N];
int n;
int C;
int pR = -1;
int start(int N, bool A[MAX_N][MAX_N]) {
n = N;
int deg[MAX_N];
for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
edg[i][j] = redg[j][i] = A[i][j];
}
for (int i = 0; i < N; ++i)
deg[i] = edg[i].count();
for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
//bad_edg_cnt[0][i][j] = 1;
//bad_edg_cnt[1][i][j] = deg[j];
depth[1][i][j] = depth[0][i][j] = 1234567890;
}
queue<vector<int>> q;
for (int i = 0; i < N; ++i) {
//bad_edg_cnt[0][i][i] = bad_edg_cnt[1][i][i] = 0;
q.push({0, i, i});
q.push({1, i, i});
used[0][i][i] = used[1][i][i] = 1;
}
int timer = 0;
while (q.size()) {
int t = q.front()[0];
int u = q.front()[1];
int v = q.front()[2];
//cout << t << ' ' << u << ' ' << v << " | ";
depth[t][u][v] = timer++;
q.pop();
bitset<MAX_N> cedg;
if (t == 0) {
cedg = redg[v];
//used[u][v] = 1;
} else {
cedg = redg[u];
cedg[u] = 1;
}
if (t == 0) {
for (int nv = cedg._Find_first(); nv < n; nv = cedg._Find_next(nv)) {
if (!used[1][u][nv] && (used[0][u] & edg[nv]) == edg[nv]) {
//cout << "(1 " << u << ' ' << nv << ") ";
q.push({1, u, nv});
used[1][u][nv] = 1;
}
}
} else {
for (int nu = cedg._Find_first(); nu < n; nu = cedg._Find_next(nu)) {
if (!used[0][nu][v]) {
//cout << "(0 " << nu << ' ' << v << ") ";
q.push({0, nu, v});
used[0][nu][v] = 1;
}
}
}
//cout << endl;
}
for (int u = 0; u < n; ++u) for (int v = 0; v < n; ++v) {
if (!used[1][u][v] || u == v)
continue;
for (int nv = edg[v]._Find_first(); nv < n; nv = edg[v]._Find_next(nv)) {
//if (depth[0][u][nv] > depth[1][u][v]) {
//cout << u << ' ' << v << ' ' << nv << " | " << depth[1][u][v] << ' ' << depth[0][u][nv] << endl;
//}
assert(depth[0][u][nv] < depth[1][u][v]);
}
}
for (int u = 0; u < n; ++u)
edg[u][u] = 1;
for (int u = 0; u < n; ++u) {
bool isok = true;
for (int v = 0; v < n; ++v) {
isok &= used[0][u][v];
//isok &= used[u][v] <= 0;
}
if (isok)
return C = u;
}
return -1;
}
int nextMove(int R) {
pR = R;
for (int nC = edg[C]._Find_first(); nC < n; nC = edg[C]._Find_next(nC)) {
if (depth[1][nC][R] < depth[0][C][R]) {
return C = nC;
}
}
assert(0);
}
Compilation message
coprobber.cpp: In function 'int start(int, bool (*)[500])':
coprobber.cpp:19:9: warning: variable 'deg' set but not used [-Wunused-but-set-variable]
19 | int deg[MAX_N];
| ^~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
0 ms |
336 KB |
Output is correct |
4 |
Correct |
68 ms |
3772 KB |
Output is correct |
5 |
Correct |
22 ms |
2376 KB |
Output is correct |
6 |
Correct |
87 ms |
5296 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
90 ms |
4472 KB |
Output is correct |
4 |
Correct |
78 ms |
3924 KB |
Output is correct |
5 |
Correct |
79 ms |
4564 KB |
Output is correct |
6 |
Correct |
77 ms |
3748 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
0 ms |
336 KB |
Output is correct |
3 |
Correct |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
0 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
0 ms |
336 KB |
Output is correct |
7 |
Correct |
0 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
0 ms |
336 KB |
Output is correct |
10 |
Correct |
1 ms |
720 KB |
Output is correct |
11 |
Correct |
4 ms |
976 KB |
Output is correct |
12 |
Correct |
1 ms |
464 KB |
Output is correct |
13 |
Correct |
1 ms |
592 KB |
Output is correct |
14 |
Correct |
4 ms |
848 KB |
Output is correct |
15 |
Correct |
2 ms |
720 KB |
Output is correct |
16 |
Correct |
2 ms |
720 KB |
Output is correct |
17 |
Correct |
12 ms |
1400 KB |
Output is correct |
18 |
Correct |
1 ms |
720 KB |
Output is correct |
19 |
Correct |
0 ms |
336 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
336 KB |
Output is correct |
2 |
Correct |
1 ms |
336 KB |
Output is correct |
3 |
Correct |
0 ms |
336 KB |
Output is correct |
4 |
Correct |
68 ms |
3772 KB |
Output is correct |
5 |
Correct |
22 ms |
2376 KB |
Output is correct |
6 |
Correct |
87 ms |
5296 KB |
Output is correct |
7 |
Correct |
0 ms |
336 KB |
Output is correct |
8 |
Correct |
1 ms |
336 KB |
Output is correct |
9 |
Correct |
90 ms |
4472 KB |
Output is correct |
10 |
Correct |
78 ms |
3924 KB |
Output is correct |
11 |
Correct |
79 ms |
4564 KB |
Output is correct |
12 |
Correct |
77 ms |
3748 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Correct |
0 ms |
336 KB |
Output is correct |
15 |
Correct |
1 ms |
336 KB |
Output is correct |
16 |
Correct |
0 ms |
336 KB |
Output is correct |
17 |
Correct |
1 ms |
336 KB |
Output is correct |
18 |
Correct |
0 ms |
336 KB |
Output is correct |
19 |
Correct |
0 ms |
336 KB |
Output is correct |
20 |
Correct |
1 ms |
336 KB |
Output is correct |
21 |
Correct |
0 ms |
336 KB |
Output is correct |
22 |
Correct |
1 ms |
720 KB |
Output is correct |
23 |
Correct |
4 ms |
976 KB |
Output is correct |
24 |
Correct |
1 ms |
464 KB |
Output is correct |
25 |
Correct |
1 ms |
592 KB |
Output is correct |
26 |
Correct |
4 ms |
848 KB |
Output is correct |
27 |
Correct |
2 ms |
720 KB |
Output is correct |
28 |
Correct |
2 ms |
720 KB |
Output is correct |
29 |
Correct |
12 ms |
1400 KB |
Output is correct |
30 |
Correct |
1 ms |
720 KB |
Output is correct |
31 |
Correct |
0 ms |
336 KB |
Output is correct |
32 |
Correct |
1 ms |
336 KB |
Output is correct |
33 |
Correct |
0 ms |
336 KB |
Output is correct |
34 |
Correct |
1 ms |
336 KB |
Output is correct |
35 |
Correct |
77 ms |
3804 KB |
Output is correct |
36 |
Correct |
20 ms |
2256 KB |
Output is correct |
37 |
Correct |
108 ms |
5328 KB |
Output is correct |
38 |
Correct |
0 ms |
336 KB |
Output is correct |
39 |
Correct |
1 ms |
336 KB |
Output is correct |
40 |
Correct |
95 ms |
4520 KB |
Output is correct |
41 |
Correct |
74 ms |
3924 KB |
Output is correct |
42 |
Correct |
94 ms |
4572 KB |
Output is correct |
43 |
Correct |
72 ms |
3888 KB |
Output is correct |
44 |
Correct |
0 ms |
336 KB |
Output is correct |
45 |
Correct |
0 ms |
336 KB |
Output is correct |
46 |
Correct |
0 ms |
336 KB |
Output is correct |
47 |
Correct |
1 ms |
336 KB |
Output is correct |
48 |
Correct |
2 ms |
720 KB |
Output is correct |
49 |
Correct |
4 ms |
976 KB |
Output is correct |
50 |
Correct |
1 ms |
464 KB |
Output is correct |
51 |
Correct |
2 ms |
592 KB |
Output is correct |
52 |
Correct |
4 ms |
848 KB |
Output is correct |
53 |
Correct |
2 ms |
720 KB |
Output is correct |
54 |
Correct |
2 ms |
720 KB |
Output is correct |
55 |
Correct |
16 ms |
1376 KB |
Output is correct |
56 |
Correct |
1 ms |
720 KB |
Output is correct |
57 |
Correct |
5 ms |
1212 KB |
Output is correct |
58 |
Correct |
13 ms |
2256 KB |
Output is correct |
59 |
Correct |
23 ms |
2824 KB |
Output is correct |
60 |
Execution timed out |
2000 ms |
31268 KB |
Time limit exceeded |
61 |
Halted |
0 ms |
0 KB |
- |