# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766075 | ono_de206 | Mechanical Doll (IOI18_doll) | C++14 | 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;
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second
// #define int long long
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
void create_circuit(int m, std::vector<int> a) {
int n = a.size();
a.pb(0);
vector<int> C(m + 1, 0), X, Y;
vector<vector<int>> nx(m + 1);
nx[0].pb(a[0]);
for(int i = 0; i < n; i++) {
nx[a[i]].pb(a[i + 1]);
}
int now = 0, root;
function<int(vector<int>&)> solve = [&](vector<int>& vec) {
if(vec.size() == 2) {
X.pb(vec[0]);
Y.pb(vec[1]);
} else {
vector<int> first, second;
for(int i = 0; i < vec.size(); i += 2) {
first.pb(vec[i]);
second.pb(vec[i + 1]);
}
X.pb(solve(first));
Y.pb(solve(second));
}
node++;
return -node;
};
for(int i = 0; i <= m; i++) {
if(nx[i].size() == 0) continue;
if(nx[i].size() == 1) {
C[i] = nx[i][0];
continue;
}
int nxt = 1;
while(nxt * 2 < nx[i].size()) nxt *= 2;
reverse(all(nx[i]));
while(nx[i].size() < nxt) nx[i].pb(i);
reverse(all(nx[i]));
C[i] = solve(nx[i]);
}
answer(C, X, Y);
}