# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
144131 | 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.
void construct_network(int H, int W, int K) {
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]}));
}
vector<int> tmp2; // if any fail, we fail
vector<int> vtmp;
vector<int> vtmp2;
for(int i=H+W-2; i>K; i--) {
vtmp.push_back(idx_diag[i]);
vtmp2.push_back(idx_diag2[i]);
//cout << idx_diag[i] << "!!!\n";
}
for(int i=0; i+K<H+W-2; i++) {
/*cout << i << ": ";
for(int i: vtmp) {
cout << i << " ";
}
cout << "\n";*/
tmp2.push_back(add_and({idx_diag[i], add_or(vtmp)}));
tmp2.push_back(add_and({idx_diag2[i], add_or(vtmp2)}));
vtmp.pop_back();
vtmp2.pop_back();
}
//add_or(tmp);
add_and({add_or(tmp), add_not(add_or(tmp2))});
}