| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1021544 | vjudge1 | Vision Program (IOI19_vision) | C++17 | 1 ms | 348 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;
int i=0,j=0;
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);
}
if(t.size()==1)p=t[0];
else p=add_or(t);
add_and({p,0});
}
| # | 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... | ||||
