# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
75978 | dimatc | Mechanical Doll (IOI18_doll) | C++14 | 108 ms | 10364 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;
int sw, k, H, leaves;
vector<int> X(400615), Y(400615);
void add(vector<int> &V2, vector<int> &V1, vector<int> &A) {
for (auto x : V1) {
if (k == H) {
if (leaves > A.size() - 1) X[x-1] = -1, leaves++;
else X[x-1] = A[leaves++];
} else {
++sw;
X[x-1] = -sw;
V2.push_back(sw);
}
}
for (auto x: V1) {
if (k == H) {
if (leaves > A.size() - 1) Y[x-1] = -1, leaves++;
else Y[x-1] = A[leaves++];
} else {
++sw;
Y[x-1] = -sw;
V2.push_back(sw);
}
}
V1.clear();
}
void create_circuit(int M, std::vector<int> A) {
vector<int> C(M + 1), V1, V2;
int N = A.size()+1;
for (H=0; (1<<H) < N; H++);
k = 1; sw=1;
V1.push_back(sw);
while (k <= H) {
if (!V1.size()) add(V1, V2, A);
else add(V2, V1, A);
++k;
}
Y[sw-1]=0;
for (int i=0; i<M+1; i++) C[i]=-1;
X.resize(leaves-1);
Y.resize(leaves-1);
answer(C, X, Y);
}
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... |