# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
879647 | andrei_boaca | Mechanical Doll (IOI18_doll) | C++17 | 129 ms | 29632 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>
//#include "grader.cpp"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n;
const int INF=1e9;
vector<int> vecini[100005];
vector<int> C,X,Y;
vector<int> v;
int lft[5000005],rgt[5000005];
int s;
int state[5000005];
int added=0;
int build(int lg)
{
if(lg==1)
return INF;
added+=lg%2;
lg+=lg%2;
int a=build(lg/2);
int b=build(lg/2);
s++;
lft[s]=a;
rgt[s]=b;
return -s;
}
int plsmake()
{
if(v.size()==1)
return v[0];
ll lg=v.size();
added=0;
int c=build(lg);
vector<pii> ord;
for(int i=1;i<=lg+added;i++)
{
int nod=c;
while(true)
{
nod=abs(nod);
if(state[nod]==0)
{
if(lft[nod]==INF)
{
ord.push_back({nod,0});
state[nod]^=1;
break;
}
state[nod]=1;
nod=lft[nod];
continue;
}
else
{
if(rgt[nod]==INF)
{
ord.push_back({nod,1});
state[nod]^=1;
break;
}
state[nod]=0;
nod=rgt[nod];
continue;
}
}
}
for(int i=0;i<ord.size();i++)
{
int who=ord[i].first;
int dir=ord[i].second;
if(i+1<v.size())
{
if(dir==0)
lft[who]=v[i];
else
rgt[who]=v[i];
continue;
}
if(i+1==ord.size())
{
if(dir==0)
lft[who]=v.back();
else
rgt[who]=v.back();
continue;
}
if(dir==0)
lft[who]=c;
else
rgt[who]=c;
}
return c;
}
void create_circuit(int M, std::vector<int> A)
{
C.resize(M+1);
n=A.size();
/*if(n==16)
{
C[0]=A[0];
for(int i=1;i<A.size();i++)
v.push_back(A[i]);
v.push_back(0);
int c=plsmake();
for(int i=1;i<=M;i++)
C[i]=c;
for(int i=1;i<=s;i++)
{
X.push_back(lft[i]);
Y.push_back(rgt[i]);
}
answer(C,X,Y);
return;
}*/
for(int i=0;i<A.size();i++)
{
int x=A[i];
int nxt=0;
if(i+1<A.size())
nxt=A[i+1];
vecini[x].push_back(nxt);
}
C[0]=A[0];
for(int i=1;i<=M;i++)
{
if(vecini[i].empty())
{
C[i]=0;
continue;
}
else
{
v=vecini[i];
C[i]=plsmake();
}
}
for(int i=1;i<=s;i++)
{
X.push_back(lft[i]);
Y.push_back(rgt[i]);
}
/*for(int i=0;i<C.size();i++)
cout<<C[i]<<' ';
cout<<'\n';
for(int i=1;i<=s;i++)
cout<<-i<<' '<<X[i-1]<<' '<<Y[i-1]<<'\n';*/
answer(C,X,Y);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |