# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144234 | icypiggy | Vision Program (IOI19_vision) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "vision.h"
#include <vector>
void construct_network(int H, int W, int K) {
if(K==H+W-2) {
add_or({add_and({0,H*W-1}),add_and({W-1,(H-1)*W})});
return;
}
vector<int> vdiag[H+W-1];
vector<int> vdiag2[H+W-1];
int idx_diag[H+W-1];
int idx_diag2[H+W-1];
for(int i=0; i<H; i++) {
for(int j=0; j<W; j++) {
vdiag[i+j].push_back(i*W+j);
vdiag2[H-1-i+j].push_back(i*W+j);
//cout << "vdiag: " << i*W+j << " " << i+j << " " << H-1-i+j << "\n";
}
}
for(int i=0; i<H+W-1; i++) {
idx_diag[i] = add_or(vdiag[i]);
}
for(int i=0; i<H+W-1; i++) {
idx_diag2[i] = add_or(vdiag2[i]);
}
vector<int> tmp;
for(int i=0; i+K<H+W-1; i++) {
tmp.push_back(add_and({idx_diag[i], idx_diag[i+K]}));
tmp.push_back(add_and({idx_diag2[i], idx_diag2[i+K]}));
}