| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350555 | Desh03 | Vision Program (IOI19_vision) | C++20 | 1 ms | 344 KiB |
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int h, int w, int k) {
vector<int> v;
for (int i = 0; i < 1; i++) {
for (int j = 0; j < 1; j++) {
for (int i2 = 0; i2 < h; i2++) {
for (int j2 = 0; j2 < w; j2++) {
if (abs(i - i2) + abs(j - j2) == k && make_pair(i, j) < make_pair(i2, j2)) {
add_and({w * i + j, w * i2 + j2});
v.push_back(h * w + v.size());
}
}
}
}
}
if (v.empty()) {
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
v.push_back({h * w + v.size()});
}
}
add_and(v);
} else {
add_or(v);
}
}
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... | ||||
