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 "vision.h"
#include <vector>
#include <algorithm>
#include <cstdlib>
#define ll int
void construct_network(int H, int W, int K) {
std::vector<ll> ads;
for (ll i = 0; i < H; ++i) for (ll j = 0; j < W; ++j) {
ll spos = (i * W) + j;
for (ll k = 0; k < W; ++k) {
ll rem = K - abs(j - k);
ll x1 = i - rem;
ll x2 = i + rem;
ll p1 = (x1 * W) + k;
ll p2 = (x2 * W) + k;
if (x1 >= 0 && x1 < H && rem >= 0) {
ads.push_back(add_and({spos, p1}));
}
if (x2 >= 0 && x2 < H && rem >= 0) {
ads.push_back(add_and({spos, p2}));
}
}
}
add_or(ads);
}
# | 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... |