| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1330143 | enzy | Vision Program (IOI19_vision) | C++20 | 1 ms | 1216 KiB |
#include "vision.h"
#include<bits/stdc++.h>
using namespace std;
bool in(int x, int y, int H, int W){
return 0<=x&&x<H&&0<=y&&y<W;
}
void construct_network(int H, int W, int K){
vector<int>ret;
for(int j=0;j<H*W;j++){
int x=j/W, y=j%W;
for(int i=-H;i<=H;i++){
int nx=x+i, ny=y+(K-i);
if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
nx=x-i, ny=y+(K-i);
if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
nx=x+i, ny=y-(K-i);
if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
nx=x-i, ny=y-(K-i);
if(j<nx*W+ny&&in(nx,ny,H,W)) ret.push_back(add_and({j,nx*W+ny}));
}
}
int ult=add_or(ret);
}
| # | 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... | ||||
