#include "vision.h"

#include <bits/stdc++.h>

using namespace std;

void construct_network(int h, int w, int k) {
    vector<int> hs(h), ws(w);
    for (int i = 0; i < h; ++i) {
        vector<int> ns;
        for (int j = 0; j < w; ++j) {
            ns.push_back(i * w + j);
        }
        hs[i] = add_or(ns);
    }
    for (int i = 0; i < w; ++i) {
        vector<int> ns;
        for (int j = 0; j < h; ++j) {
            ns.push_back(j * w + i);
        }
        ws[i] = add_or(ns);
    }
    vector<int> hd(min(h, k + 1)), wd(min(w, k + 1));
    for (int i = 0; i < (int)hd.size(); ++i) {
        if (i == 0) {
            hd[i] = add_xor(hs);
        } else if (w != 1 || i == k) {
            vector<int> temp;
            for (int j = 0; j + i < h; ++j) {
                temp.push_back(add_and({hs[j], hs[j + i]}));
            }
            hd[i] = add_or(temp);
        }
    }
    for (int i = 0; i < (int)wd.size(); ++i) {
        if (i == 0) {
            wd[i] = add_xor(ws);
        } else if (h != 1 || i == k) {
            vector<int> temp;
            for (int j = 0; j + i < w; ++j) {
                temp.push_back(add_and({ws[j], ws[j + i]}));
            }
            wd[i] = add_or(temp);
        }
    }
    vector<int> temp;
    for (int i = 0; i < (int)hd.size(); ++i) {
        if (k - i < (int)wd.size()) {
            if (w != 1 && h != 1) {
                temp.push_back(add_and({hd[i], wd[k - i]}));
            } else if (i == 0 || i == k) {
                temp.push_back(add_and({hd[i], wd[k - i]}));
            }
        }
    }
    add_or(temp);
}