# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014986 | u_suck_o | Vision Program (IOI19_vision) | C++17 | 10 ms | 4564 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#include "vision.h"
using namespace std;
void construct_network(int H, int W, int K) {
vector<pair<int,int>> v;
for (int i = 0; i <= K; i++) {
v.push_back({i, K-i});
v.push_back({-i, i-K});
if (i != 0 && i != K) {
v.push_back({i, i-K});
v.push_back({-i, K-i});
}
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
vector<int> v2;
//go through neighbors
for (int k = 0; k < v.size(); k++) {
if (i + v[k].first < 0 || i + v[k].first >= H) continue;
if (j + v[k].second < 0 || j + v[k].second >= W) continue;
v2.push_back((i+v[k].first)*W + (j+v[k].second));
}
if (v2.size())
add_or(v2);
else
add_not(i*W+j);
}
}
for (int i = 0; i < H*W; i++) {
vector<int> v2;
v2.push_back(i);
v2.push_back(H*W+i);
add_and(v2);
}
vector<int> v2;
for (int i = 2*H*W; i < 3*H*W; i++) v2.push_back(i);
add_or(v2);
}
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... |