# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395271 | rama_pang | Chessboard (IZhO18_chessboard) | C++17 | 542 ms | 4372 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 namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
vector<array<int, 4>> rect;
for (int i = 0; i < k; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
a--, b--, c--, d--;
rect.push_back({a, b, c, d});
}
auto Solve = [&](int s) -> long long {
long long res = 1ll * (n / s) * (n / s) / 2 * s * s;
if (n / s % 2 == 1) {
res += 1ll * s * s;
}
auto CountCorner = [&](int sx, int sy, int ex, int ey) -> long long {
if (sx > ex || sy > ey) return 0;
assert(sx / s == ex / s && sy / s == ey / s);
if ((sx / s + sy / s) & 1) {
return +1ll * (ex - sx + 1) * (ey - sy + 1);
} else {
return -1ll * (ex - sx + 1) * (ey - sy + 1);
# | 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... |