# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
767160 | adrilen | Mechanical Doll (IOI18_doll) | C++17 | 112 ms | 13644 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>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
constexpr int max_siz = 1 << 18;
constexpr int root = 1;
int l[max_siz] = { 0 }, r[max_siz] = { 0 };
int timing(int p, int bit)
{
int output = 0;
for (int i = bit; i >= 0; i--)
{
if (p & (1 << i)) output += (1 << (bit - i));
}
return output;
}
// n is the length of a
// m is the number of triggers
bool can_be_reached[max_siz] = { 0 };
int prefix_sum[max_siz] = { 0 };
# | 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... |