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"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
void construct_network(int n, int m, int K){
auto valid = [&](int i, int j) -> int {
return 0 <= i && i < n && 0 <= j && j < m;
};
auto idx = [&](int i, int j) -> int {
return i * m + j;
};
int ptr = n * m;
vector<int> res;
for (int i = 0; i < n; i++){
for (int j = 0; j < m; j++){
if (valid(i + K, j)){
add_and({idx(i + K, j)});
res.push_back(ptr++);
}
for (int k = 1; k <= K; k++){
if (valid(i + (K - k), j - k)){
add_and({idx(i, j), idx(i + (K - k), j - k)});
res.push_back(ptr++);
}
if (valid(i + (K - k), j + k)){
add_and({idx(i, j), idx(i + (K - k), j + k)});
res.push_back(ptr++);
}
}
}
}
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... |