# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
228523 | maximath_1 | Vision Program (IOI19_vision) | C++17 | 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<bits/stdc++.h>
using namespace std;
int solve(int h, int w, int k){
vector<int>diagL[400], diagR[400], prefL, prefR, res;
for(int i=0; i<h; i++)
for(int j=0; j<w; j++){
diagL[i+j].push_back(i*w+j);
diagR[i+(w-1-j)].push_back(i*w+j);
}
for(int d=k; d<h+w-1; d++){
prefL.push_back(add_or(diagL[d-k]));
prefR.push_back(add_or(diagR[d-k]));
ans.push_back(add_and({add_or(diagL[d]), add_or(prefL)}));
ans.push_back(add_and({add_or(diagR[d]), add_or(prefR)}));
}
return add_or(ans);
}
void construct_network(int h, int w, int k){
if(k==h+w-2) solve(h, w, k);
else add_and({solve(h, w, k), add_not(solve(h, w, k+1))});
}