# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839448 | dong_liu | Maze (JOI23_ho_t3) | C++17 | 1994 ms | 852460 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")
#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif
typedef pair<int, int> pi;
struct Range {
vector<int> p;
vector<bool> rem;
Range(int n) : p(n), rem(n, false) {
for (int i = 0; i < n; i++) p[i] = i;
}
int dsf(int i) {
return p[i] == i ? i : p[i] = dsf(p[i]);
}
void dsj(int i, int j) { p[dsf(i)] = dsf(j); }
bool has(int i) { return !rem[i]; }
void remove(int i) {
if (i > 0 && rem[i-1]) dsj(i-1, i);
if (i+1 < int(p.size()) && rem[i+1]) dsj(i, i+1);
rem[i] = 1;
# | 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... |