# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
742286 | t6twotwo | Vision Program (IOI19_vision) | C++17 | 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;
vector<int> v;
void AND() {
add_and(v);
v.clear();
}
void XOR() {
add_xor(v);
v.clear();
}
void OR() {
add_or(v);
v.clear();
}
void construct_network(int H, int W, int K) {
int T = H * W;
auto get = [&](int x, int y) {
return x * W + y;
};
vector<int> v;
if (min(H, W) == 1) {
if (H != 1) {
swap(H, W);
}
for (int i = 0; i + K < W; i++) {
add_and({i, i + K});
v.push_back(T++);
}
OR(v);
return;
}
if (K == 1) {
vector<int> A(H);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
v.push_back(get(i, j));
}
A[i] = T++;
OR(v);
}
vector<int> B(W);
for (int j = 0; j < W; j++) {
for (int i = 0; i < H; i++) {
v.push_back(get(i, j));
}
B[j] = T++;
OR(v);
}
vector<int> C(H - 1);
for (int i = 0; i + 1 < H; i++) {
C[i] = T++;
add_and({A[i], A[i + 1]});
}
vector<int> D(W - 1);
for (int i = 0; i + 1 < W; i++) {
D[i] = T++;
add_and({B[i], B[i + 1]});
}
for (int i = 0; i < H; i++) {
v.push_back(A[i]);
}
int x = T++;
XOR(v);
for (int i = 0; i + 1 < W; i++) {
v.push_back(D[i]);
}
int y = T++;
OR(v);
int z = T++;
add_and({x, y});
for (int i = 0; i < W; i++) {
v.push_back(B[i]);
}
int a = T++;
XOR(v);
for (int i = 0; i + 1 < H; i++) {
v.push_back(C[i]);
}
int b = T++;
OR(v);
int c = T++;
add_add({a, b});
add_or({z, c});
return;
}
for (int i = 0; i <= K; i++) {
if (i < H && K - i < W) {
add_and({0, get(i, K - i)});
v.push_back(T++);
}
}
OR(v);
}