#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;
}
}
// H rows + W cols
// all pairs distance 1
// all pairs distance 2
// 1 pair distance H-1
int end_pos_x = H*W + H + W;
vector<int> positions_rows;
vector<int> positions_cols;
for (int j = 1; j < H; j++) {
positions_rows.push_back(end_pos_x);
for (int i = 0; i < H - j; i++) {
positions[0] = H*W + i;
positions[1] = H*W + i + j;
add_and(positions);
}
}
for (int j = 1; j < W; j++) {
positions_cols.push_back(end_pos_x);
for (int i = 0; i < W - j; i++) {
positions[0] = H*W + H + i;
positions[1] = H*W + H + i + j;
add_and(positions);
}
}
vector<int> positions_final_or;
for (int j = 1; j < K; j++) {
// j in H, (K-j) in W
int options_y = H - j;
int options_x = W - (K - j);
vector<int> positions_and;
positions_and.push_back(0);
positions_and.push_back(0);
if ((options_y > 0) && (options_x > 0)) {
int position_y = positions_rows[j - 1];
int position_x = positions_cols[K - j - 1];
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < options_y; i++) {
positions.push_back(position_y++);
}
positions_and.push_back(add_or(positions));
positions.erase(positions.begin(), positions.end());
for (int i = 0; i < options_x; i++) {
positions.push_back(position_x++);
}
positions_and.push_back(add_or(positions));
positions_final_or.push_back(add_and(positions_and));
}
}
// 0-K and K-0
for (int j = 0; j < H - K; j++) {
positions2[0] = H*W + j;
positions2[1] = H*W + j + K;
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;
positions_final_or.push_back(add_and(positions2));
}
add_or(positions_final_or);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 1), (1, 0), expected 0, but computed 1 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 1), (1, 0), expected 0, but computed 1 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 1), (1, 0), expected 0, but computed 1 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 1), (1, 0), expected 0, but computed 1 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
6 ms |
1148 KB |
WA in grader: Too many instructions |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
384 KB |
on inputs (0, 0), (1, 1), expected 0, but computed 1 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
8 ms |
4476 KB |
WA in grader: Too many inputs |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
256 KB |
Output is correct |
2 |
Correct |
5 ms |
256 KB |
Output is correct |
3 |
Correct |
4 ms |
256 KB |
Output is correct |
4 |
Correct |
4 ms |
256 KB |
Output is correct |
5 |
Incorrect |
4 ms |
256 KB |
on inputs (0, 1), (1, 0), expected 0, but computed 1 |
6 |
Halted |
0 ms |
0 KB |
- |