#include "vision.h"
#include <cstdio>
#include <iostream>
#include <queue>
#include <set>
#include <map>
#define N 205
using namespace std;
int h, w, k, T, en, mn = 2e9, mx, v[N][N];
int dr[4] = {-1, 0, 0, 1}, dc[4] = {0, -1, 1, 0};
set<int> vi[40005];
vector<int> ans;
queue<int> qr, qc, qe;
int pq_num(int p, int q) {
return p * w + q;
}
void pu(int p, int q, int e) {
if (p < 0 || p >= h || q < 0 || q >= w || v[p][q] == T) return;
v[p][q] = T;
qr.push(p);
qc.push(q);
qe.push(e);
}
vector<int> in;
void f(int p, int q, int k) {
int i, tr, tc, te, re, x1, x2, t1, t2;
x1 = pq_num(p, q);
pu(p, q, 0);
in.clear();
while (!qr.empty()) {
tr = qr.front(); qr.pop();
tc = qc.front(); qc.pop();
te = qe.front(); qe.pop();
if (te == k) {
x2 = pq_num(tr, tc);
if (vi[x1].count(x2) == 1) continue;
vi[x1].insert(x2);
vi[x2].insert(x1);
in.push_back(x2);
// in.push_back(x1);
// in.push_back(x2);
// re = add_and(in);
// mn = min(mn, re);
// mx = max(mx, re);
} else {
for (i = 0; i < 4; i++) {
pu(tr + dr[i], tc + dc[i], te + 1);
}
}
}
if (!in.empty()) {
t1 = add_or(in);
t2 = add_and({t1, x1});
ans.push_back(t2);
}
}
void construct_network(int hh, int ww, int kk) {
int i, j;
h = hh;
w = ww;
k = kk;
for (i = 0; i < h; i++) {
for (j = 0; j < w; j++) {
T++;
f(i, j, k);
}
}
add_or(ans);
// Ns = {0, 1};
// int a = add_and(Ns);
// Ns = {0, a};
// int b = add_or(Ns);
// Ns = {0, 1, b};
// int c = add_xor(Ns);
// add_not(c);
}
