# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766836 | DJeniUp | Mechanical Doll (IOI18_doll) | C++17 | 1070 ms | 10296 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;
typedef int ll;
#define pb push_back
#define fr first
#define sc second
ll h,a[200007],b[200007],f[200007];
vector<ll>v[200007];
vector<ll>c,x,y;
void create_circuit(int M, std::vector<int> A) {
A.pb(0);
for(int i=0;i<A.size()-1;i++){
v[A[i]].pb(A[i+1]);
}
c.pb(A[0]);
for(int i=1;i<=M;i++){
if(v[i].size()==0)c.pb(0);
else if(v[i].size()==1)c.pb(v[i][0]);
else{
h++;
x.pb(-h);
y.pb(-h);
c.pb(-h);
for(int j=0;j<v[i].size();j++){
ll k=-c[i]-1;
while(1){
if(f[k]%2==0){
f[k]++;
if(x[k]==0){
x[k]=v[i][j];
break;
}else if(x[k]<0){
k=-x[k]-1;
}else{
h++;
f[h-1]=1;
x.pb(-h);
y.pb(-h);
x[h-1]=x[k];
x[k]=-h;
k=h-1;
}
}else{
f[k]++;
if(y[k]==0){
y[k]=v[i][j];
break;
}else if(y[k]<0){
k=-y[k]-1;
}else{
h++;
f[h-1]=1;
x.pb(-h);
y.pb(-h);
x[h-1]=y[k];
y[k]=-h;
k=h-1;
}
}
}
}
}
}
//cout<<c.size()<<" "<<x.size()<<" "<<y.size()<<endl;
for(int i=0;i<=M;i++){
// cout<<i<<" "<<c[i]<<endl;
}
for(int i=0;i<x.size();i++){
// cout<<-i-1<<" "<<x[i]<<" "<<y[i]<<endl;
}
answer(c,x,y);
return ;
}
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... |