# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97058 | youngyojun | Mechanical Doll (IOI18_doll) | C++11 | 155 ms | 10872 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 eb emplace_back
using namespace std;
const int MAXN = 200055;
int B[MAXN*2][2], C[MAXN*2];
int A[MAXN];
int N, M, K, NP;
int f(int s, int e) {
if(N <= s) return 1;
if(s == e) return -1;
int m = (s+e) >> 1, c = ++K;
B[c][1] = f(s, m);
B[c][0] = f(m+1, e);
return c;
}
void solve() {
N++; for(NP = 2; NP < N; NP <<= 1);
f(0, NP-1);
for(int i = 1, c = 0; c < N;) {
int &j = B[i][C[i]&1]; C[i]++;
if(j < 0) {
j = -A[c++];
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... |