| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370791 | kawhiet | Vision Program (IOI19_vision) | C++20 | 1 ms | 1216 KiB |
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
void construct_network(int n, int m, int k) {
auto f = [&](int i, int j) {
return i * m + j;
};
vector<int> pos;
int id = n * m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (i < n - 1) {
add_and({f(i, j), f(i + 1, j)});
pos.push_back(id++);
}
if (j < m - 1) {
add_and({f(i, j), f(i, j + 1)});
pos.push_back(id++);
}
}
}
add_or(pos);
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
