#include "vision.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
void construct_network(int H, int W, int K) {
vector<int> lis[2] = {{}, {}};
for (int d = -(W - 1); d < H; ++d) {
vector<int> cur;
for (int i = max(0, d); i < min(H, W + d); ++i) cur.push_back(i * W + (i - d));
lis[0].push_back(add_or(cur));
}
for (int d = 0; d < W + H - 1; ++d) {
vector<int> cur;
for (int i = max(0, d - W + 1); i < min(H, d + 1); ++i) cur.push_back(i * W + d - i);
lis[1].push_back(add_or(cur));
}
vector<int> largerList, equalList;
for (int k = 0; k < 2; ++k) {
for (int i = 0; i + K < (int) lis[k].size(); ++i) {
equalList.push_back(add_and({lis[k][i], lis[k][i + K]}));
}
vector<int> pref = {lis[k][0]};
for (int i = 1; i + K + 1 < (int) lis[k].size(); ++i) {
pref.push_back(add_or({pref[i - 1], lis[k][i]}));
}
for (int i = 0; i + K + 1 < (int) lis[k].size(); ++i) {
largerList.push_back(add_and({pref[i], lis[k][i + K + 1]}));
}
}
if (largerList.empty()) {
add_or(equalList);
return;
}
int largerID = add_or(largerList), equalID = add_or(equalList);
int tmp = add_not(largerID);
add_and({equalID, tmp});
}
