| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 609846 | jairRS | 자동 인형 (IOI18_doll) | C++17 | 0 ms | 0 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 vi = vector<int>;
using vvi = vector<vi>;
void arrangeEndpoints(vi &endpoints)
{
if (endpoints.size() == 2)
return;
vi half1, half2;
for (int i = 0; i < endpoints.size(); i++)
{
if (i % 2 == 0)
half1.push_back(endpoints[i]);
else
half2.push_back(endpoints[i]);
}
arrangeEndpoints(half1);
arrangeEndpoints(half2);
endpoints.clear();
for (int x : half1)
endpoints.push_back(x);
for (int x : half2)
endpoints.push_back(x);
}
void create_circuit(int M, vi A)
{
int N = A.size(), S = 0;
A.push_back(0);
vi C(M + 1, 0), X, Y;
auto addSwitch = [&S, &X, &Y](int x, int y)
{
S++;
X.push_back(x);
Y.push_back(y);
return -S;
};
auto buildSwitchTree = [&S, &C, &X, &Y, &addSwitch](int trigger, vi &endpoints)
{
if (endpoints.size() == 1)
return C[trigger] = endpoints[0];
if (endpoints.size() == 2)
return C[trigger] = addSwitch(endpoints[0], endpoints[1]);
// treeSize = power2*2 - 1
// tree Ids in [1, power2*2 - 1]
// switch Ids in [S + 1, S + power2*2 - 1]
int power2 = 1;
while (power2 < endpoints.size())
power2 *= 2;
while (endpoints.size() < power2)
{
endpoints.push_back(-(S + 1));
swap(endpoints.back(), endpoints[endpoints.size() - 2]);
}
arrangeEndpoints(endpoints);
C[trigger] = -(S + 1);
for (int i = 1; i <= power2 - 1; i++)
{
int left = i * 2, right = i * 2 + 1;
if (right <= power2 - 1)
{
X.push_back(-(S + left));
Y.push_back(-(S + right));
}
else
{
left -= power2;
right -= power2;
X.push_back(endpoints[left]);
Y.push_back(endpoints[right]);
}
}
S += power2 - 1;
return 0;
};
vvi toMap(M + 1, vi(0));
toMap[0].push_back(A[0]);
for (int i = 0; i < N; i++)
toMap[A[i]].push_back(A[i + 1]);
for (int trg = 0; trg <= M; trg++)
{
vi &endpoints = toMap[trg];
if (endpoints.size() != 0)
buildSwitchTree(trg, endpoints);
}
// answer(C, X, Y);
}
int main()
{
create_circuit(3, {3, 3, 1, 3, 2});
}