# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
295460 | Kastanda | Mechanical Doll (IOI18_doll) | C++11 | 121 ms | 13012 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.
// M
#include<bits/stdc++.h>
#include "doll.h"
using namespace std;
const int N = 400005;
int n, m, k, len, ts, need, A[N], L[N], R[N], B[N];
int Solve(int l, int r)
{
if (!need)
return -1;
if (r - l < 2)
{
need --;
return B[l];
}
int v = ++ ts;
R[v] = Solve((l + r) >> 1, r);
L[v] = Solve(l, (l + r) >> 1);
return -v;
}
void create_circuit(int _m, vector < int > _A)
{
m = _m;
n = (int)_A.size();
for (int i = 0; i < n; i ++)
A[i] = _A[i];
A[n] = 0;
if (n == 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... |