# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
301006 | TMJN | 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 "doll.h"
#include <bits/stdc++.h>
using namespace std;
static int c;
static vector<int>K;
static vector<int>X,Y,C;
int dfs(int num,int dep){
if(num+(1<<dep)>=K.size()){
return K[num];
}
else{
int t=c;
c++;
X[t]=dfs(num,dep+1);
Y[t]=dfs(num+(1<<dep),dep+1);
return -t-1;
}
}
void create_circuit(int M,vector<int>A){
c=0;
K=A;
X=Y=vector<int>(400000,0);
C=vector<int>(M+1,0);
for(int i=0;;i++){
if(K.size()<(1<<i)){
while(K.size()<(1<<i)){
K.push_back(-c-1);
c++;
}
c--;
K.back()=0;
break;
}
}
int cc=c;
int tt=dfs(0,0);
C=vector<int>(M+1,tt);
for(int i=0;i<cc;i++){
X[i]=-i-1;
Y[i]=tt;
}
vector<bool>B(400000,false);
int p=0;
vector<int>T;
do{
if(p>=0){
if(p)T.push_back(p);
p=C[p];
}
else{
if(B[-p-1]){
B[-p-1]=!B[-p-1];
p=Y[-p-1];
}
else{
B[-p-1]=!B[-p-1];
p=X[-p-1];
}
}
}while(p);
assert(A==T);
bool f=false;
for(int i=0;i<400000;i++){
f|=B[i];
}
assert(!f);
for(int i:C){
assert(-(int)X[i].size()<=i&&i<=M);
}
answer(C,X,Y);
}