| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 166063 | 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;
#include "vision.h"
vector<int>V;
int ans(){
return add_or(V);
}
void construct_network(int h, int w, int K){
vector<int> Dr[405],Dl[405],cur,p,b,a;
int diag[405],dia[450],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);
Dl[i+j].push_back(i*w+j);
}
for(int i=w+h-1;i>=0;i--){
cur.clear();
cur.push_back(add_or(Dr[i]));
p.clear();
p.push_back(diag[i+1]);
diag[i]=add_and({add_or(cur),add_or(p)});
if(i+k<=w+h-1){
p.clear();
p.push_back(diag[i+k]);
a.push_back(add_and({diag[i+k],add_or(cur)}));
}
if(i+k<=w+h-2){
p.clear();
p.push_back(diag[i+k+1]);
b.push_back(add_and({p,add_and(cur)}));
}
V.push_back(add_xor({b,a}));
}
for(int i=0;i<=w+h-1;i++){
cur.clear();
cur.push_back(add_or(Dl[i]));
p.clear();
p.push_back(dia[i+1]);
dia[i]=add_and({add_or(cur),add_or(p)});
if(i-k>=0){
p.clear();
p.push_back(dia[i-k]);
a.push_back(add_and({diag[i-k],add_or(cur)}));
}
if(i-k>=1){
p.clear();
p.push_back(diag[i-k-1]);
b.push_back(add_and({p,add_and(cur)}));
}
V.push_back(add_xor({b,a}));
}
ans();
}
