#include "vision.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void construct_network(int H, int W, int K) {
    vector<int> R(H), C(W);

    auto toi = [&](int x, int y) {
        return x * W + y;
    };

    for (int i = 0; i < H; ++i) {
        vector<int> a;
        for (int j = 0; j < W; ++j) {
            a.push_back(toi(i, j));
        }
        R[i] = add_or(a);
    }

    for (int j = 0; j < W; ++j) {
        vector<int> a;
        for (int i = 0; i < H; ++i) {
            a.push_back(toi(i, j));
        }
        C[j] = add_or(a);
    }

    vector<int> orz;

    for (int x = 1; x < K; ++x) {
        int y = K - x;
        if (y >= W || x >= H) {
            continue;
        }
        vector<int> ax, ay;
        for (int i = 0; i + x < H; ++i) {
            ax.push_back(add_and({R[i], R[i + x]}));
        }
        for (int j = 0; j + y < W; ++j) {
            ay.push_back(add_and({C[j], C[j + y]}));
        }
        orz.push_back(add_and({add_or(ax), add_or(ay)}));
    }

    // handle x = 0 && x = K separately
    if (K < W) {
        // case 1: x = 0
        vector<int> ax, ay;
        for (int i = 0; i < H; ++i) {
            vector<int> xr;
            for (int j = 0; j < W; ++j) {
                xr.push_back(toi(i, j));
            }
            ax.push_back(add_not(add_xor(xr)));
        }
        for (int j = 0; j + K < W; ++j) {
            ay.push_back(add_and({C[j], C[j + K]}));
        }
        ax.push_back(add_or(ay));
        orz.push_back(add_and(ax));
    }
    if (K < H) {
        // case 2: x = K
        vector<int> ax, ay;
        for (int i = 0; i + K < H; ++i) {
            ay.push_back(add_and({R[i], R[i + K]}));
        }
        for (int j = 0; j < W; ++j) {
            vector<int> xr;
            for (int i = 0; i < H; ++i) {
                xr.push_back(toi(i, j));
            }
            ax.push_back(add_not(add_xor(xr)));
        }
        ax.push_back(add_or(ay));
        orz.push_back(add_and(ax));
    }
    add_or(orz);
}