# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41171 | aome | Chessboard (IZhO18_chessboard) | C++14 | 551 ms | 104812 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;
const int N = 100005;
struct Rec {
int x1, y1, x2, y2;
} rec[N];
int n, m;
long long res = 1e18;
void cal(int x, int l, int r, int *cnt) {
cnt[0] = cnt[1] = 0;
if (l / x != r / x) {
cnt[0] += ( (r / x - 1) / 2 - l / x / 2 ) * x;
if (r / x % 2 == 0) cnt[0] += r - r / x * x + 1;
if (l / x % 2 == 0) cnt[0] += (l / x + 1) * x - l;
}
else {
if (l / x % 2 == 0) cnt[0] += r - l + 1;
}
cnt[1] = r - l + 1 - cnt[0];
// cout << "# " << cnt[0] << ' ' << cnt[1] << '\n';
}
void solve(int fix) {
long long val1 = 0, val2 = 0;
// change all white -> black
# | 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... |