#include "vision.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef int ll;
using namespace std;
using namespace __gnu_pbds;
#define FOR(i, x, y) for(ll i=x; i<y; i++)
#define FORNEG(i, x, y) for(ll i=x; i>y; i--)
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define fast() ios_base::sync_with_stdio(false);cin.tie(NULL)
ll h,w,k;
vector<int> hashh(vector<int> a){
return {a[0]+a[1], a[1]-a[0]};
}
int unhashh(vector<int> a){
vector<int> temp = {(a[0]-a[1])/2, (a[0]+a[1])/2};
return w*temp[0]+temp[1];
}
void construct_network(int H, int W, int K) {
h=H; w=W; k=K;
set<ll> x;
set<ll> y;
vector<vector<ll>> stuff;
FOR(i,0,h){
FOR(j,0,w){
stuff.push_back(hashh({i,j}));
}
}
for (auto&i : stuff){
x.insert(i[0]);
y.insert(i[1]);
}
vector<int> fx, fy, sx, sy;
for (auto&i : x){
vector<int> fir,sec;
for (auto&j : stuff){
if (j[0] == i) fir.push_back(unhashh(j));
else if (j[0] == i-k || j[0] == i+k) sec.push_back(unhashh(j));
}
if (!(fir.size() && sec.size())){
fx.push_back(add_xor({0,0}));
fx.push_back(add_xor({0,0}));
continue;
}
fx.push_back(add_xor(fir));
fx.push_back(add_xor(sec));
}
for (auto&i : y){
vector<int> fir,sec;
for (auto&j : stuff){
if (j[1] == i) fir.push_back(unhashh(j));
else if (j[1] >= i-k && j[1] <= i+k) sec.push_back(unhashh(j));
}
if (!(fir.size() && sec.size())){
fy.push_back(add_xor({0,0}));
fy.push_back(add_xor({0,0}));
continue;
}
fy.push_back(add_xor(fir));
fy.push_back(add_xor(sec));
}
for (auto&i : y){
vector<int> fir,sec;
for (auto&j : stuff){
if (j[1] == i) fir.push_back(unhashh(j));
else if (j[1] == i-k || j[1] == i+k) sec.push_back(unhashh(j));
}
if (!(fir.size() && sec.size())){
sy.push_back(add_xor({0,0}));
sy.push_back(add_xor({0,0}));
continue;
}
sy.push_back(add_xor(fir));
sy.push_back(add_xor(sec));
}
for (auto&i : x){
vector<int> fir,sec;
for (auto&j : stuff){
if (j[0] == i) fir.push_back(unhashh(j));
else if (j[0] >= i-k && j[0] <= i+k) sec.push_back(unhashh(j));
}
if (!(fir.size() && sec.size())){
sx.push_back(add_xor({0,0}));
sx.push_back(add_xor({0,0}));
continue;
}
sx.push_back(add_xor(fir));
sx.push_back(add_xor(sec));
}
vector<int> ffx, ffy, ssx, ssy;
while (fx.size()){
ll temp1,temp2;
temp1 = fx[fx.size()-1];
temp2 = fx[fx.size()-2];
ffx.push_back(add_and({temp1, temp2}));
fx.pop_back();
fx.pop_back();
}
while (fy.size()){
ll temp1,temp2;
temp1 = fy[fy.size()-1];
temp2 = fy[fy.size()-2];
ffy.push_back(add_and({temp1, temp2}));
fy.pop_back();
fy.pop_back();
}
while (sx.size()){
ll temp1,temp2;
temp1 = sx[sx.size()-1];
temp2 = sx[sx.size()-2];
ssx.push_back(add_and({temp1, temp2}));
sx.pop_back();
sx.pop_back();
}
while (sy.size()){
ll temp1,temp2;
temp1 = sy[sy.size()-1];
temp2 = sy[sy.size()-2];
ssy.push_back(add_and({temp1, temp2}));
sy.pop_back();
sy.pop_back();
}
ll a,b,c,d;
a = add_or(ffx);
b = add_or(ffy);
c = add_or(ssx);
d = add_or(ssy);
ll aa = add_and({a,b});
ll bb = add_and({c,d});
add_or({aa,bb});
}
