# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
827956 | null_awe | Maze (JOI23_ho_t3) | C++17 | 2093 ms | 382504 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.
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
static char buf[450 << 20];
void* operator new(size_t s) {
static size_t i = sizeof buf;
assert(s < i);
return (void*)&buf[i -= s];
}
void operator delete(void*) {}
const int UNTIL = 4206900;
vector<int> dx = {-1, 1, 0, 0}, dy = {0, 0, -1, 1};
int csqrt[UNTIL], fsqrt[UNTIL];
void init() {
csqrt[1] = fsqrt[1] = 1;
for (int i = 2; i < UNTIL; ++i) {
fsqrt[i] = fsqrt[i - 1];
while ((fsqrt[i] + 1) * (fsqrt[i] + 1) <= i) ++fsqrt[i];
csqrt[i] = fsqrt[i];
if (fsqrt[i] * fsqrt[i] < i) ++csqrt[i];
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |