| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 767024 | DJeniUp | 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;
typedef int ll;
#define pb push_back
#define fr first
#define sc second
ll h,a[400007],b[400007],f[400007],u[400007];
vector<ll>v[200007];
priority_queue<pairll,vector<pairll>, greater<pairll> >p;
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]==-k-1){
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]==-k-1){
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;
}
}
}
}
}
}
while(1){
ll k=c[0];
ll z=0;
ll r=0;
for(int i=0;i<h;i++){
f[i]=0;
u[i]=0;
}
while(p.size()>0)p.pop();
ll pr=0;
while(k!=0){
r++;
pr=k;
if(k>0){
k=c[k];
}else{
if(u[-k-1]==0)u[-i-1]=r;
if(f[-k-1]%2==0){
p.push({u[-i-1],k});
f[-k-1]++;
k=x[-k-1];
}else{
f[-k-1]++;
k=y[-k-1];
}
}
}
//cout<<p.back()<<" "<<f[-p.back()-1]<<endl;
reverse(p.begin(),p.end());
while(p.size()>0 && f[-p.top()-1]%2==0)p.pop();
if(p.size()==0)break;
while(p.size()>0){
while(p.size()>0 && f[-p.back()-1]%2==0)p.pop();
if(p.size()==0)break;
z=p.top().sc;
p.pop_back();
//cout<<z<<endl;
if(f[-z-1]%2==0){
break;
}else{
if(pr>0)c[pr]=z;
else{
if(f[-pr-1]%2==1)x[-pr-1]=z;
else y[-pr-1]=z;
}
k=-z-1;
while(1){
pr=-k-1;
if(f[k]%2==0){
p.push({u[k],-k-1});
f[k]++;
if(x[k]==-k-1){
x[k]=0;
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]==-k-1){
y[k]=0;
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++){
//if(x[i]==-i-1)swap(x[i],y[i]);
//cout<<-i-1<<" "<<x[i]<<" "<<y[i]<<endl;
}
if(h>2*A.size()-2)exit(1);
answer(c,x,y);
return ;
}