| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1327512 | nicolo_010 | Vision Program (IOI19_vision) | C++20 | 2 ms | 948 KiB |
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void construct_network(int H, int W, int k) {
int id = H*W;
for (int i=0; i<H*W; i++) {
if (i+k >= H*W) continue;
vector<int> Ns = {i, i+k};
add_and(Ns);
id++;
}
vector<int> res;
for (int i=H*W; i<id; i++) {
res.push_back(i);
}
add_or(res);
}
| # | 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... | ||||
