# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587500 | KoD | Chessboard (IZhO18_chessboard) | C++17 | 314 ms | 4288 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>
using ll = long long;
using std::vector;
using std::array;
using std::pair;
using std::tuple;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, Q;
std::cin >> N >> Q;
vector<int> A(Q), B(Q), C(Q), D(Q);
for (int i = 0; i < Q; ++i) {
std::cin >> A[i] >> B[i] >> C[i] >> D[i];
A[i] -= 1;
B[i] -= 1;
}
const auto calc = [&](const int x, const int d) {
const int q = x / d;
const int r = x % d;
if (q % 2 == 0) {
return r;
} else {
return d - r;
}
};
ll ans = (ll)N * N;
for (int d = 1; d < N; ++d) {
# | 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... |