# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168995 | cormac | Chessboard (IZhO18_chessboard) | C++14 | 404 ms | 5132 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;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using bk = tuple<ll, int, int, int, int>;
ll INF = 1LL << 60;
int find(int p, int k) {
return p / (2 * k) * k + min(k, p % (2 * k));
}
ll count1d(int x, int w, int k) {
return find(x + w, k) - find(x, k);
}
ll count2d(int x, int y, int w, int h, int k) {
ll r = count1d(x, w, k);
ll c = count1d(y, h, k);
return r * c + (w-r) * (h-c);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
# | 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... |