#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef vector<int> vi;
const int len = 205;
int n, m, k;
bool exist(int i, int j){
return (0 <= i && i < n && 0 <= j && j < m);
}
int match(int i, int j){
return i*m + j;
}
vi diag_sum(int con){
vi res;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (i+j == con) res.pb(match(i, j));
return res;
}
vi diag_dif(int con){
vi res;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (i-j == con) res.pb(match(i, j));
return res;
}
void construct_network(int H, int W, int K) {
n = H, m = W, k = K;
vi temp, sum, dif;
/// precompute everything
// compute sum[], dif[]
for (int con = 0; con <= n+m-2; con++)
sum.pb(add_xor(diag_sum(con)));
for (int con = -m+1; con <= n-1; con++)
dif.pb(add_xor(diag_dif(con)));
// compute equal_sum, equal_dif
temp.clear();
for (int i = 0; i+k < sum.size(); i++)
temp.pb(add_and({sum[i], sum[i+k]}));
int equal_sum = add_or(temp);
temp.clear();
for (int i = 0; i+k < dif.size(); i++)
temp.pb(add_and({dif[i], dif[i+k]}));
int equal_dif = add_or(temp);
// compute less_sum, less_dif
temp.clear();
temp.pb(add_not(add_or(sum))), temp.pb(equal_sum);
for (int i = 0; i < sum.size(); i++){
vi temp2;
for (int j = i+1; j < min(i+k, (int)sum.size()); j++)
temp2.pb(sum[j]);
if (!temp2.empty())
temp.pb(add_and({sum[i], add_or(temp2)}));
}
int less_sum = add_or(temp);
temp.clear();
temp.pb(add_not(add_or(dif))), temp.pb(equal_dif);
for (int i = 0; i < dif.size(); i++){
vi temp2;
for (int j = i+1; j < min(i+k, (int)dif.size()); j++)
temp2.pb(dif[j]);
if (!temp2.empty())
temp.pb(add_and({sum[i], add_or(temp2)}));
}
int less_dif = add_or(temp);
//printf("equal_sum = %d, less_sum = %d\n", equal_sum, less_sum);
//printf("equal_dif = %d, less_dif = %d\n", equal_dif, less_dif);
/// find ans:)
add_or({add_and({less_sum, equal_dif}), add_and({less_dif, equal_sum})});
}
