| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1327127 | nikaa123 | Vision Program (IOI19_vision) | C++20 | 358 ms | 1204 KiB |
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;
void construct_network(int H, int W, int K) {
int cur = H*W;
vector <int> res;
for (int id1 = 0; id1 < H*W; id1++) {
for (int id2 = id1+1; id2 < H*W; id2++) {
int x1 = id1/W; int y1 = id1%W;
int x2 = id2/W; int y2 = id2%W;
if (abs(x1-x2) + abs(y1-y2) == K) {
res.push_back(cur++);
add_and({id1,id2});
}
}
}
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... | ||||
