#include "vector"
#include "vision.h"
#define P push_back
void construct_network(int H, int W, int K) {
int i,j,N;
std::vector <int> b,v,h,r;
for(i=0;i<H;)
{
for(j=0;j<W;)v.P(i++ * W + j++);
b.P(add_xor(v));
v = {b.back()};
}
for (j = 0; j < W;){
for (i = 0; i < H;){
v.P(i++ * W + j++);
}
b.P(add_xor(v));
v = {b.back()};
}
int l = b.back();
for (i = 0; i < 9; i++){
r.P(add_xor(b));
if (K>>i&1)r[i] = add_not(r[i]);
N=l,h.clear();
for(int i:b) {
h.P(add_and({N, i}));
N = add_xor({N, i});
}
b = h;
}
add_not(add_or(r));
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
1 ms |
212 KB |
on inputs (0, 0), (1, 1), expected 1, but computed 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
on inputs (80, 199), (81, 199), expected 1, but computed 0 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
WA in grader: Invalid index |
2 |
Halted |
0 ms |
0 KB |
- |