# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413394 | Ahmadsm2005 | 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 "grader.cpp"
#include<bits/stdc++.h>
using namespace std;
int seg[800002],state[800002],depth,TOTSTATE,X[800002],Y[800002];
void upd(int v,int idx=0,int DEPTH=0){
if(DEPTH==depth){
if(!state[idx]){
X[idx]=v,TOTSTATE++,state[idx]=1;
}
else{
state[idx]=0,TOTSTATE--,Y[idx]=v;
}
return;
}
if(!state[idx]){
state[idx]=1,TOTSTATE++,upd(v,idx*2+1,DEPTH+1);
}
else{
state[idx]=0,TOTSTATE--,upd(v,idx*2+2,DEPTH+1);
}
X[idx]=-(idx*2+2),Y[idx]=-(idx*2+3);
}
void create_circuit(int M,vector<int>A){
int Q=1;
while(Q<=A.size())
Q*=2,depth++;
if(M==-1){
int N = A.size();
vector<int> C(M + 1);
C[0] = -1;
for (int i = 1; i <= M; ++i) {
C[i] = -1;
}
vector<int>X,Y;
string s;
while(N){
s+=('0'+N%2);
N/=2;
}
reverse(s.begin(),s.end());
for(int i=0;i<s.size();i++){
if(s[i]=='1')
X.push_back(1);
else
X.push_back(-1);
if(i+1!=s.size())
Y.push_back((-i)-2);
}
Y.push_back(0);
/*for(int i=0;i<X.size();i++)
cout<<X[i]<<' ';
cout<<endl;
for(int i=0;i<Y.size();i++)
cout<<Y[i]<<' ';*/
answer(C, X, Y);
return;
}
vector<int> C(M + 1);
for(int i=0;i<=M;i++)
C[i]=-1;
int TOT=Q;
TOT--;
depth--;
reverse(A.begin(),A.end());
for(int i=0;i<A.size();i++){
upd(A[i]);
TOT--;
}
while(TOT){
upd(-1);
TOT--;
}
upd(0);
if(Q>N*2)
exit(1);
vector<int>XX,YY;
for(int i=0;i<Q-1;i++)
XX.push_back(X[i]),YY.push_back(Y[i]);
answer(C,XX,YY);
}