# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102074 | bert30702 | Mechanical Doll (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 <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#include "doll.h"
#endif
using namespace std;
const int MX = 4e5 + 1000;
int ptr = 0;
int x[MX], y[MX], c[MX];
#ifndef ONLINE_JUDGE
void answer(vector<int> c, vector<int> x, vector<int> y) {
cout << x.size() << endl;
for(auto it: c) cout << it << ' '; cout << endl;
for(auto it: x) cout << it << ' '; cout << endl;
for(auto it: y) cout << it << ' '; cout << endl;
}
#endif
int build(vector<int> v) {
if(ptr != 0 and *max_element(v.begin(), v.end()) == *min_element(v.begin(), v.end())) return v[0];
int d = --ptr;
vector<int> a, b;
for(int i = 0; i < v.size(); i ++) {
if(i & 1) b.push_back(v[i]);
else a.push_back(v[i]);
}
x[-d] = build(a);
y[-d] = build(b);
return d;
}
void create_circuit(int n, vector<int> v) {
vector<int> a(v.begin() + 1, v.end()); a.push_back(0);
int k = max(2, 1 << __lg(a.size() * 2 - 1));
vector<int> tmp(k), GG(k, 0);
int need = k - a.size();
for(int i = k / 2; i >= 1; i >>= 1) {
for(int j = 0; j < k; j += i) {
if(!GG[j] and need) {
GG[j] = true, tmp[j] = -1, need --;
}
}
}
for(int i = k - 1; i >= 0; i --) {
if(!GG[i]) tmp[i] = a.back(), a.pop_back();
}
exit(0);
build(tmp); c[0] = v[0];
for(int i = 1; i <= n; i ++) c[i] = -1;
answer(
vector<int>(c, c + n + 1),
vector<int>(x + 1, x + 1 - ptr),
vector<int>(y + 1, y + 1 - ptr)
);
}
#ifndef ONLINE_JUDGE
main () {
create_circuit(1, {1, 1});
}
#endif