# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165939 | lukameladze | 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"
using namespace std;
int w,h,k;
vector<int >d1[100005],d2[100005],x1,x2,y11,y2,xx1,xx2,yy1,yy2,v,vv,v1;
void construct_network(int H, int W, int K){
{
for (int i=0; i<H; i++)
{
for (int j=0; j<W; j++)
{
d1[i+j].push_back(i*W+j);
d2[i-j+W-1].push_back(i*W+j);
}
}
for (int i=0; i<H+W-1; i++)
{
x1.push_back(add_or(d1[i]));
y11.push_back(add_or(d2[i]));
x2.push_back(add_or(x1));
y2.push_back(add_or(x2));
if (i>=K)
{
v.push_back(add_and(x1[i],x2[i-K]));
v.push_back(add_and(y11[i],y2[i-K]));
}
}
for (int i=0; i<h+w-1; i++)
{
xx1.push_back(add_or(d1[i]));
yy1.push_back(add_or(d2[i]));
xx2.push_back(add_or(x1));
yy2.push_back(add_or(x2));
if (i>=K+1)
{
vv.push_back(add_and(xx1[i],xx2[i-K-1]));
vv.push_back(add_and(yy1[i],yy2[i-K-1]));
}
}
v1.push_back(add_or(v));
v1.push_back(add_or(vv))
return add_xor(v1);
}