| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1135038 | alterio | Vision Program (IOI19_vision) | C++20 | 0 ms | 328 KiB |
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int H, int W, int K) {
auto f = [&] (int x, int y) {
return x * W + y;
};
int sz = 0;
int i = 0, j = 0;
for (int l = 0; l <= K; l++) {
int rest = K - l;
int nx = i + l, ny = j + rest;
if (nx < H && ny < W) {
int x = add_and({f(i, j), f(nx, ny)});
sz++;
}
ny = j - rest;
if (nx < H && ny >= 0) {
int x = add_and({f(i, j), f(nx, ny)});
sz++;
}
}
vector<int> v;
for (int i = H * W; sz; sz--, i++) v.push_back(i);
add_or(v);
}
| # | 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... | ||||
