#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 202;
int H, W, K;
int one, zero;
int cell(int i, int j) {
return i * W + j;
}
vector<int> binary_addition(vector<int> A, vector<int> B) {
int carry = zero;
vector<int> ret;
int len = max(A.size(), B.size()) + 1;
while(A.size() < len) A.emplace_back(zero);
while(B.size() < len) B.emplace_back(zero);
for(int i = 0; i < len - 1; i++) {
ret.emplace_back(add_xor({carry, A[i], B[i]}));
int ab = add_and({carry, A[i]});
int bc = add_and({A[i], B[i]});
int ca = add_and({carry, B[i]});
carry = add_or({ab, bc, ca});
} ret.emplace_back(carry);
return ret;
}
void construct_network(int _H, int _W, int _K) {
H = _H, W = _W, K = _K;
if(H * W == 2) {
one = 0;
zero = add_not(one);
} else {
zero = add_and({0, 1, 2});
one = add_not(zero);
}
vector<int> R_prefix, C_prefix;
{
int prev = zero;
for(int i = 0; i < H - 1; i++) {
vector<int> tmp;
for(int j = 0; j < W; j++) {
tmp.emplace_back(cell(i, j));
}
tmp.emplace_back(prev);
R_prefix.emplace_back(add_xor(tmp));
prev = R_prefix.back();
}
R_prefix.emplace_back(zero);
}
{
int prev = zero;
for(int j = 0; j < W - 1; j++) {
vector<int> tmp;
for(int i = 0; i < H; i++) {
tmp.emplace_back(cell(i, j));
}
tmp.emplace_back(prev);
C_prefix.emplace_back(add_xor(tmp));
prev = C_prefix.back();
}
C_prefix.emplace_back(zero);
}
vector<int> R_sum;
for(int i = 0; i < H - 1; i++) {
vector<int> tmp;
int carry = R_prefix[i];
for(int j = 0; j < R_sum.size(); j++) {
tmp.emplace_back(add_xor({carry, R_sum[j]}));
carry = add_and({carry, R_sum[j]});
}
if(tmp.size() < 32 - __builtin_popcount(i + 1)) {
tmp.emplace_back(carry);
}
R_sum = tmp;
}
vector<int> C_sum;
for(int i = 0; i < W - 1; i++) {
vector<int> tmp;
int carry = C_prefix[i];
for(int j = 0; j < C_sum.size(); j++) {
tmp.emplace_back(add_xor({carry, C_sum[j]}));
carry = add_and({carry, C_sum[j]});
}
if(tmp.size() < 32 - __builtin_popcount(i + 1)) {
tmp.emplace_back(carry);
}
C_sum = tmp;
}
vector<int> tot = binary_addition(R_sum, C_sum);
vector<int> allzero, allone;
for(int i = 0; i < tot.size(); i++) {
if(K & (1 << i)) {
allzero.emplace_back(add_xor({one, tot[i]}));
} else {
allzero.emplace_back(add_xor({zero, tot[i]}));
}
}
for(int i = 0; i < allzero.size(); i++) {
allone.emplace_back(add_not(allzero[i]));
}
add_and(allone);
}
