#include <vision.h>
#include <vector>
using namespace std;
void construct_network(int H, int W, int K) {
vector<int> positions;
vector<int> positions2;
positions2.push_back(0);
positions2.push_back(0);
for (int i = 0; i < W; i++) {
positions.push_back(i);
}
for (int j = 0; j < H; j++) {
add_xor(positions);
for (int i = 0; i < W; i++) {
positions[i] += W;
}
}
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < H; i++) {
positions.push_back(i*W);
}
for (int j = 0; j < W; j++) {
add_xor(positions);
for (int i = 0; i < H; i++) {
positions[i] += 1;
}
}
vector<int> positions_final_or;
// starting from W*H + H + W, put xor of all positions
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < H; i++) {
positions.push_back(W*H + i);
add_xor(positions);
}
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < W; i++) {
positions.push_back(W*H + H + i);
add_xor(positions);
}
for (int j = 1; j < K; j++) {
int options_y = H - j;
int options_x = W - (K - j);
if ((options_y > 0) && (options_x > 0)) {
vector<int> positions_or_y;
vector<int> positions_or_x;
for (int i = 0; i < options_y; i++) {
vector<int> positions_and;
for (int k = 0; k < j; k++) {
positions_and.push_back(H*W + H + W + i + k);
}
positions_or_y.push_back(add_and(positions_and));
}
positions2[0]=add_or(positions_or_y);
for (int i = 0; i < options_x; i++) {
vector<int> positions_and;
for (int k = 0; k < (K - j); k++) {
positions_and.push_back(H*W + H + W + H + i + k);
}
positions_or_x.push_back(add_and(positions_and));
}
positions2[1] = add_or(positions_or_x);
positions_final_or.push_back(add_and(positions2));
}
}
positions2.push_back(0);
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < W; i++) {
positions.push_back(H*W + H + i);
}
int pos1 = add_not(add_or(positions));
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < H; i++) {
positions.push_back(H*W + i);
}
int pos2 = add_not(add_or(positions));
// 0-K and K-0
for (int j = 0; j < H - K; j++) {
positions2[0] = H*W + j;
positions2[1] = H*W + j + K;
positions2[2] = pos1;
positions_final_or.push_back(add_and(positions2));
}
for (int j = 0; j < W - K; j++) {
positions2[0] = H*W + H + j;
positions2[1] = H*W + H + j + K;
positions2[2] = pos2;
positions_final_or.push_back(add_and(positions2));
}
add_or(positions_final_or);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 2), (1, 0), expected 0, but computed 1 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 2), (1, 0), expected 0, but computed 1 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 2), (1, 0), expected 0, but computed 1 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 2), (1, 0), expected 0, but computed 1 |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
512 KB |
Output is correct |
2 |
Correct |
7 ms |
512 KB |
Output is correct |
3 |
Correct |
7 ms |
512 KB |
Output is correct |
4 |
Correct |
7 ms |
512 KB |
Output is correct |
5 |
Correct |
7 ms |
512 KB |
Output is correct |
6 |
Correct |
7 ms |
512 KB |
Output is correct |
7 |
Correct |
7 ms |
512 KB |
Output is correct |
8 |
Correct |
7 ms |
512 KB |
Output is correct |
9 |
Correct |
7 ms |
512 KB |
Output is correct |
10 |
Correct |
7 ms |
512 KB |
Output is correct |
11 |
Correct |
7 ms |
512 KB |
Output is correct |
12 |
Correct |
7 ms |
512 KB |
Output is correct |
13 |
Correct |
7 ms |
512 KB |
Output is correct |
14 |
Correct |
8 ms |
640 KB |
Output is correct |
15 |
Correct |
7 ms |
512 KB |
Output is correct |
16 |
Correct |
7 ms |
512 KB |
Output is correct |
17 |
Correct |
7 ms |
512 KB |
Output is correct |
18 |
Correct |
7 ms |
512 KB |
Output is correct |
19 |
Correct |
7 ms |
512 KB |
Output is correct |
20 |
Correct |
7 ms |
512 KB |
Output is correct |
21 |
Correct |
4 ms |
256 KB |
Output is correct |
22 |
Correct |
4 ms |
256 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
6 ms |
512 KB |
Output is correct |
4 |
Incorrect |
12 ms |
1024 KB |
on inputs (0, 0), (4, 28), expected 0, but computed 1 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
1664 KB |
Output is correct |
2 |
Correct |
4 ms |
256 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
8 ms |
640 KB |
Output is correct |
5 |
Correct |
7 ms |
512 KB |
Output is correct |
6 |
Correct |
7 ms |
512 KB |
Output is correct |
7 |
Correct |
12 ms |
1024 KB |
Output is correct |
8 |
Correct |
12 ms |
1024 KB |
Output is correct |
9 |
Correct |
18 ms |
1684 KB |
Output is correct |
10 |
Correct |
5 ms |
256 KB |
Output is correct |
11 |
Correct |
4 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
4 ms |
384 KB |
Output is correct |
3 |
Correct |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
4 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 2), (1, 0), expected 0, but computed 1 |
9 |
Halted |
0 ms |
0 KB |
- |