# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
839156 | benjaminkleyn | Mechanical Doll (IOI18_doll) | C++17 | 110 ms | 16140 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;
typedef long long ll;
typedef long double ld;
vector<int> X, Y;
int build(vector<int> &nxt)
{
if (nxt.size() < 2)
return 0;
if (nxt.size() == 2)
{
X.push_back(nxt[0]);
Y.push_back(nxt[1]);
return -X.size();
}
int i = X.size();
X.push_back(0);
Y.push_back(0);
reverse(nxt.begin(), nxt.end());
while (__builtin_popcount(nxt.size()) != 1)
nxt.push_back(-1-i);
reverse(nxt.begin(), nxt.end());
vector<int> l, r;
for (int i = 0; i < nxt.size(); i += 2)
{
l.push_back(nxt[i]);
r.push_back(nxt[i+1]);
}
X[i] = build(l);
Y[i] = build(r);
return -1-i;
}
void create_circuit(int M, vector<int> A)
{
vector<vector<int>> nxt(M + 1, vector<int>());
vector<int> root(M + 1);
int N = A.size();
nxt[0].push_back(A[0]);
for (int i = 0; i < N - 1; i++)
nxt[A[i]].push_back(A[i+1]);
nxt[A[N-1]].push_back(0);
vector<int> C(M + 1);
for (int i = 0; i <= M; i++)
if (nxt[i].size() == 1)
C[i] = nxt[i][0];
else
C[i] = build(nxt[i]);
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... |