#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
bool limites(int x, int y, int h, int w) {
return x >= 0 && x < h && y >= 0 && y < w;
}
void construct_network(int H, int W, int K) {
if(H>30&&W>30){
map<pair<int, int>, int> numero;
int pos = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
numero[{i, j}] = pos;
pos++;
}
}
vector<int>filas_or;
int filas_xor;
for (int i = 0; i < H; i++) {
vector<int>prueba;
for (int j = 0; j < W; j++) {
prueba.push_back(numero[{i,j}]);
}
filas_or.push_back(add_or(prueba));
}
filas_xor=add_xor(filas_or);
vector<int>columnas_or;
int columnas_xor;
for (int j = 0; j < W; j++) {
vector<int>prueba;
for (int i = 0; i < H; i++) {
prueba.push_back(numero[{i,j}]);
}
columnas_or.push_back(add_or(prueba));
}
columnas_xor=add_xor(columnas_or);
vector<int>fin;
for(int i=0;i<H-1;i++){
fin.push_back({add_and({filas_or[i],filas_or[i+1],columnas_xor})});
}
for(int i=0;i<W-1;i++){
fin.push_back({add_and({columnas_or[i],columnas_or[i+1],filas_xor})});
}
add_or(fin);
return;
}
else{
map<pair<int, int>, int> numero;
int pos = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
numero[{i, j}] = pos;
pos++;
}
}
vector<int> dx, dy;
for (int restar = 0; restar <= K; restar++) {
int c_x = restar;
int c_y = K - restar;
dx.push_back(c_x);
dy.push_back(c_y);
if (c_y != 0) {
dx.push_back(c_x);
dy.push_back(-c_y);
}
}
map<pair<pair<int, int>, pair<int, int>>, bool> marked;
vector<int>xd;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
vector<int>vecinos;
for (int itr = 0; itr < dx.size(); itr++) {
int x = i + dx[itr];
int y = j + dy[itr];
if (limites(x, y, H, W)) {
if (!marked[{{i, j}, {x, y}}] && !marked[{{x, y}, {i, j}}]) {
vecinos.push_back({numero[{x,y}]});
marked[{{i, j}, {x, y}}] = true;
}
}
}
if(!vecinos.empty()){
xd.push_back(add_and({numero[{i,j}],add_or(vecinos)}));
}
}
}
add_or(xd);
return;
}
}
