| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1327529 | nicolo_010 | Vision Program (IOI19_vision) | C++20 | 157 ms | 2224 KiB |
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int dis(int i1, int j1, int i2, int j2) {
return abs(i1-i2) + abs(j1-j2);
}
void construct_network(int H, int W, int k) {
int S=H*W;
map<pii, int> mp;
for (int i=0; i<H; i++) {
for (int j=0; j<W; j++) {
int id = i*W + j;
for (int i1=0; i1<H; i1++) {
for (int j1=0; j1<W; j1++) {
if (dis(i, j, i1, j1) == k) {
int id1 = i1*W + j1;
if (mp.count({id, id1})) continue;
vector<int> Ns = {id, id1};
add_and(Ns);
mp[{id, id1}] = 1;
mp[{id1, id}] = 1;
S++;
}
}
}
}
}
vector<int> res;
for (int i=H*W; i<S; 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... | ||||
