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"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
vector<int> C, X(1 << 18), Y(1 << 18);
vector<bool> tree((1 << 18) + 5, true);
void rec(int index, int value)
{
if (index >= 1 << 17)
{
if (tree[index])
X[index - 1] = value;
else
Y[index - 1] = value;
}
else if (tree[index])
rec(index * 2, value);
else
rec(index * 2 + 1, value);
tree[index] = !tree[index];
}
void create_circuit(int M, std::vector<int> A)
{
int N = A.size();
C.resize(M + 1);
fill(C.begin(), C.end(), -1);
C[0] = A[0];
for (int i = 1; i < 1 << 17; i++)
{
X[i - 1] = i * -2;
Y[i - 1] = i * -2 - 1;
}
int t = 1 << 18;
for (int i = 1; i < N; i++)
{
t--;
rec(1, A[i]);
}
--t;
while (t--)
rec(1, -1);
rec(1, 0);
answer(C, X, Y);
}
# | 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... |