Submission #1237468

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237468		dosts	Mechanical Doll (IOI18_doll)	C++20	0 / 100	2 ms	3396 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
int id = 0;
vi X,Y;
vi toggle(800005,0);

int play(int node,int l,int r) {
  if (l == r) return l;
  toggle[node]^=1;
  int m = (l+r) >> 1;
  if (toggle[node]) {
      return play(2*node,l,m);
  }else return play(2*node+1,m+1,r);
}

vi getorder(int n) {
  toggle.assign(4*n+1,0);
  vi ord;
  for (int i=1;i<=n;i++) ord.push_back(play(1,1,n));
  return ord;
}

void reorder(vi& v) {
  int n = v.size();
  if (n == 1) return;
  vi nw(n);
  vi ord = getorder(n);
  for (int i=0;i<n;i++) nw[ord[i]-1] = v[i];
  v = nw;
}

int newtree(vi& v,int l,int r,int ord = 0) {
  if (big(v)%2) {
    ++id;
    v.insert(v.begin(),-id);
    X.push_back(-id);
    Y.push_back(-(id+big(v)-1));
    r++;
  }
  if (!ord) reorder(v);
  if (l == r) {
    return v[l-1];
  }
  if (l == r-1) {
    ++id;
    X.push_back(v[l-1]);
    Y.push_back(v[l]);
    return -id;
  }
  int m = (l+r) >> 1;
  int id1 = newtree(v,l,m,1);
  int id2 = newtree(v,m+1,r,1);
  ++id;
  X.push_back(id1);
  Y.push_back(id2);
  return -id;
}

void create_circuit(int M, std::vector<int> A) {
  int N = A.size();
  vi go[M+1];
  go[0].push_back(A[0]);
  for (int i=0;i<N-1;i++) go[A[i]].push_back(A[i+1]);
  go[A.back()].push_back(0);
  std::vector<int> C(M + 1);
  
  for (int i = 0; i <= M; ++i) {
    if (big(go[i])) C[i] = newtree(go[i],1,big(go[i]));
    else C[i] = i;
  }
  answer(C, X, Y);
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 18
• Subtask 6: 0 / 56