# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1021450 | vjudge1 | Vision Program (IOI19_vision) | C++17 | 2 ms | 984 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<vector>
#include<iostream>
using namespace std;
void construct_network(int H, int W, int K){
int x,y,p;
vector<int>r;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
vector<int>t;
for(int k=0;k<K;k++){
x=i+k;
y=j-K+k;
if(0<=x&&x<H&&0<=y&&y<W)t.push_back(x*W+y);
x=i+K-k;
y=j+k;
if(0<=x&&x<H&&0<=y&&y<W)t.push_back(x*W+y);
x=i-k;
y=j+K-k;
if(0<=x&&x<H&&0<=y&&y<W)t.push_back(x*W+y);
x=i-K+k;
y=j-k;
if(0<=x&&x<H&&0<=y&&y<W)t.push_back(x*W+y);
}
if(!t.empty()){
p=t[0];
for(int k=1;k<t.size();k++)p=add_or({p,t[k]});
}
p=add_and({p,i*W+j});
r.push_back(p);
}
}
p=r[0];
for(int i=1;i<r.size();i++)p=add_or({p,r[i]});
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |