# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68105 | MatheusLealV | Chessboard (IZhO18_chessboard) | C++17 | 1169 ms | 47424 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>
#define N 100050
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
ll n, k, x[N], y[N], xf[N], yf[N];
long long ans = (2000000000000000000ll);
vector<ll> d;
inline ll conta(ll x, ll y, ll r)
{
x ++, y ++;
ll tx = (x/r), ty = (y/r);
int rx = (tx % 2 == 0 ? 1 : 0), ry = (ty % 2 == 0 ? 1 : 0);
ll xo = ((tx + 1)/2)*r + (rx ? x % r : 0);
ll xi = (x - xo);
ll yo = ((ty + 1)/2)*r + (ry ? y % r : 0);
ll yi = (y - yo);
# | 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... |