제출 #526360

#제출 시각아이디문제언어결과실행 시간메모리
526360lkh3happy자동 인형 (IOI18_doll)C++17
100 / 100
108 ms14596 KiB
#include "doll.h"
#include <bits/stdc++.h>
using namespace std;

int idx[800001], dir[800001], cnt, a;
vector<int> c, x, y;

void create_circuit(int m, vector<int> A){
    c.push_back(A[0]);
    int n=A.size(), k=1;
    A.push_back(0);
    for(int i=1;i<=m;i++) c.push_back(-1+(n==1));
    while(k<n) k*=2;
    for(int i=k;i<k+k-n;i++) idx[i]=-1;
    for(int i=k-1;i>0;i--) idx[i]=(idx[i*2]+idx[i*2+1])/2;
    for(int i=1;i<=n;i++, a=0){
        while(a<k-n+k) for(a=1;a<k;dir[a]^=1, a=a*2+(dir[a]^1));
        idx[a]=A[i];
    }
    for(int i=1;i<k;i++) if(!idx[i]) idx[i]=--cnt;
    x.resize(-cnt); y.resize(-cnt);
    for(int i=1;i<k;i++) if(i==1 || idx[i]+1) x[-idx[i]-1]=idx[i*2], y[-idx[i]-1]=idx[i*2+1];
    answer(c, x, y);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...