# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330540 | lLab_ | 자동 인형 (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;
vector<int> X,Y,C;
int cnt = 0;
int createS(int x,int y){
cnt--;
X.push_back(x);
Y.push_back(y);
return cnt;
}
int create(vector<int> v){
bool ok = true;
for(int i=1;i<v.size();++i){
if(v[i] != v[i-1]){
ok = false;
break;
}
}
if(v.size() == 1 || ok){
return v[0];
}
vector<int> x,y;
for(int i=0;i<v.size();++i){
if(i%2==0) x.push_back(v[i]);
else y.push_back(v[i]);
}
l = create(x);
r = create(y);
return createS(l,r);
}
int rev(int k,int n){
int B = 0;
for(int i=0;i<k;++i){
B <<= 1;
B = n&1;
n >>= 1;
}
return B;
}
void create_circuit(int M, std::vector<int> A) {
int N = A.size();
int nn = 0;
while(1<<nn < N){
nn++;
}
nn = 1<<nn;
vector<int> v(nn,0);
for(int i=0;i<nn-N+1;++i){
v[rev(i)] = 2e9;
}
int curr = 0;
for(int i=1;i<A.size();++i){
while(v[curr] == 2e9) curr++;
v[curr] = A[i];
}
v[nn-1] = 0;
int root = create(v);
for(int i=0;i<X.size();++i){
if(X[i] == 2e9) X[i] = root;
}
for(int i=0;i<Y.size();++i){
if(Y[i] == 2e9) Y[i] = root;
}
C.resize(M+1,root);
C[0] = A[0];
return answer(C,X,Y);
}