# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261138 | Nightlight | Mechanical Doll (IOI18_doll) | C++14 | 68 ms | 11228 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 "doll.h"
#include <bits/stdc++.h>
#define LOG2(n) (31 - __builtin_clz(n))
#define pii pair<int, int>
using namespace std;
int N, M;
int A[200005];
int tmp[200005];
int order[200005];
int to[200005];
int id[200005], pos[200005];
int X[200005], Y[200005];
int tot;
int cnt = 2;
void gen_order(int l, int r) {
if(l == r) return void(pos[order[l]] = l);
int mid = ((l + r) >> 1) + 1;
for(int i = l; i <= r; i += 2) {
tmp[l + (i - l) / 2] = order[i];
tmp[mid + (i - l) / 2] = order[i + 1];
}
for(int i = l; i <= r; i++) order[i] = tmp[i];
gen_order(l, mid - 1), gen_order(mid, r);
}
int DFS(int l, int r) {
int now;
if(l + 1 == r) {
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... |