# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
578710 | Vanilla | Vision Program (IOI19_vision) | C++17 | 9 ms | 1088 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;
int dist (int x1, int y1, int x2, int y2) {
return abs(x2 - x1) + abs(y2 - y1);
}
void construct_network(int H, int W, int K) {
int op = 0;
vector <int> row, col;
for (int i = 0; i < H; i++){
vector <int> v;
for (int j = 0; j < W; j++){
v.push_back(i * W + j);
}
row.push_back(add_or(v));
}
for (int j = 0; j < W; j++){
vector <int> v;
for (int i = 0; i < H; i++){
v.push_back(i * W + j);
}
col.push_back(add_or(v));
}
vector <int> rs;
vector <int> c23;
for (int i = 0; i + K < H; i++){
c23.push_back(add_and({row[i], row[i + K]}));
}
for (int i = 0; i + K < W; i++){
c23.push_back(add_and({col[i], col[i + K]}));
}
if (c23.size() >= 1) rs.push_back(add_xor(c23));
}
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... |