| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 165927 | keta_tsimakuridze | 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<bits/stdc++.h>
using namespace std;
vector<int>V;
int ans(){
return add_or(V);
}
void construct_network(int h, int w, int K){
vector<int> Dr[405],Dl[405];
int cur,diag[405],d[450],a,b,k;
for(int i=0;i<w;i++)
for(int j=0;j<h;j++){
Dr[i-j+h-1].push_back(i*w+j);
}
for(int i=0;i<w;i++)
for(int j=0;j<h;j++){
Dl[i+j].push_back(i*w+j);
}
for(int i=w+h-1;i>=0;i--){
cur=add_or(Dr[i]);
diag[i]=add_or(cur,diag[i+1]);
b=0;
if(i+k<=w+h-1){
a=add_and(diag[i+k],cur);
}
if(i+k<=w+h-2)
b=add_and(diag[i+k+1],cur);
V.push_back(add_xor(b,a));
}
for(int i=0;i<=w+h-1;i++){
cur=add_or(Dl[i]);
d[i]=add_or(cur,d[max(0,i-1)]);
b=0;
if(i-k>=0){
a=add_and(d[i-k],cur);
}
if(i-k-1>=0)
b=add_and(d[i-k-1],cur);
V.push_back(add_xor(b,a));
}
ans();
}
