# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165784 | nikatamliani | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <"vision.h";
# include <bits/stdc++.h>
using namespace std;
int get(int H, int W, int K){
vector < int > x[500], y[500], x1, y1, x2, y2, res;
for(int i = 0; i < H; i ++){
for(int j = 0; j < W; j ++){
x[i + j].push_back(i * W + j);
y[i - j + W - 1].push_back(i * W + j);
}
}
for(int i = 0; i <= H + W - 2; i ++){
x1.push_back(add_or(x[i]));
y1.push_back(add_or(y[i]));
x2.push_back(add_or(x1));
y2.push_back(add_or(y1));
if(i >= K){
res.push_back(add_and(x1[i], x2[i - K]));
res.push_back(add_and(y1[i], y2[i - K]));
}
}
return add_or(res);
}
void construct_network(int H, int W, int K){
if(H + W - 2 > K){
add_xor(get(H, W, K), get(H, W, K + 1));
} else{
get(H, W, K);
}
}