| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370708 | kawhiet | Vision Program (IOI19_vision) | C++20 | 0 ms | 344 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;
for (int x = 0; x <= k; x++) {
int y = k - x;
if (x < n && y < m) {
pos.push_back(f(x, y));
add_and({0, f(x, y)});
}
}
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... | ||||
