# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
542809 | Sho10 | 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> //Andrei Alexandru a.k.a Sho
#include "doll.h"
using ll=int;
int const nmax = 400000;
using namespace std;
ll leftp[nmax+1],rightp[nmax+1],cng[nmax+1],real[nmax+1],switches=0,added=0;
vector<int>a;
ll creategraph(ll nodes,ll realnodes){
if(realnodes==0){
return -1;
}
if(nodes==1){
return (added++);
}
ll centr=-(++switches);
leftp[-centr]=creategraph(nodes/2,realnodes-min(int(nodes/2),realnodes));
rightp[-centr]=creategraph(nodes/2,min(int(nodes/2),realnodes));
return centr;
}
ll dfs(ll node){
if(node>=0){
return node;
}else {
cng[-node]=(!cng[-node]);
if(b[-node]==1){
dfs(leftp[-node]);
}else dfs(rightp[-node]);
}
}
void create_circuit(int M,vector<int>A){
vector<int>C(M+1);
C[0]=-1;
for(int i=1;i<=M;i++)
{
C[i]=-1;
}
for(ll i=0;i<A.size();i++)
{
a.push_back(A[i]);
}
a.push_back(0);
int nodes=1;
while(nodes<a.size()){
nodes*=2;
}
creategraph(nodes,a.size());
for(int i=0;i<a.size();i++)
{
real[dfs(-1)]=a[i];
}
vector<int>X(switches),Y(switches);
for(ll k=1;k<=switches;k++)
{
X[k-1]=leftp[k];
Y[k-1]=rightp[k];
if(X[k-1]>=0){
X[k-1]=real[X[k-1]];
}
if(Y[k-1]>=0){
Y[k-1]=real[Y[k-1]];
}
}
answer(C,X,Y);
}