# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
492362 | Rainbowbunny | Chessboard (IZhO18_chessboard) | C++17 | 472 ms | 4296 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 MAXN = 1e5 + 5;
int n, k;
int xl[MAXN], xr[MAXN], yl[MAXN], yr[MAXN];
pair <int, int> Get(int p, int id)
{
if(p < 0)
{
return make_pair(0, 0);
}
int seg = p / id + 1;
int cw = (seg + 1) / 2, cb = seg / 2;
if(cw == cb)
{
return make_pair(cw * id, (cb - 1) * id + p % id + 1);
}
else
{
return make_pair((cw - 1) * id + p % id + 1, cb * id);
}
}
long long Solve(int id)
{
long long tmp = 1ll * (n / id) * (n / id) / 2;
long long curans = tmp * id * id;
# | 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... |