Submission #475994

#	Time	Username	Problem	Language	Result	Execution time	Memory
475994		kessido	Mechanical Doll (IOI18_doll)	C++17	100 / 100	116 ms	11040 KiB

doll

#include "doll.h"
#include <bits/stdc++.h>
const int UNASSINED = 1'000'000'000;
const int ROOT = 1'000'000'001;
 
using vi = std::vector<int>;

template<typename T>
void print_array(std::string name, const T& array) {
  std::cout << name << "[Array]:\n";
  for(auto &i : array) std::cout << i << " ";
  std::cout << '\n';
}

vi create_level(const vi& last_level, vi& X, vi& Y, int& S) {
  vi new_level;
  for(size_t i = 0; i < last_level.size(); i+=2) {
    if(i+1 < last_level.size()) {
      X.push_back(last_level[i]);
      Y.push_back(last_level[i+1]);
    } else {
      X.push_back(ROOT);
      Y.push_back(last_level[i]);
    }
    new_level.push_back(-1 * (++S));
  }
  return new_level;
}
 
int& simulate_untill_next_unassined(int cur_switch, vi& state, vi& X, vi& Y) {
  while(true) {
    int idx = -cur_switch - 1;
    int* ptr = state[idx] ? &Y[idx] : &X[idx];
    state[idx] ^= 1;
    int& val = *ptr;
    if(val == UNASSINED) return val;
    assert(val < 0);
    cur_switch = val;
  }
}
 
void create_circuit(int M, std::vector<int> A) {
  const int N = A.size();
  // create tree with N leefs
  vi X, Y;
  vi last_level(N, UNASSINED);
  int S = 0;
  do { 
    last_level = create_level(last_level, X, Y, S);
  } while(last_level.size() != 1);
  
  int root = -S;
  assert(last_level.back() == root);
  for(int i = 0; i < S; i++)
    if(X[i]==ROOT)
      X[i] = root;
 
  vi C(M + 1, root);
  C[0] = A[0]; // first go to A0, and than everyone goes to root.
  vi state(S);
  for(int i = 1; i < N; i++) {
    int& v = simulate_untill_next_unassined(root, state, X, Y);
    v = A[i];
  }
  int& last_v = simulate_untill_next_unassined(root, state, X, Y);
  last_v = 0;
  for(int i : state) assert(i == 0);
  for(int i : X) assert(i != UNASSINED);
  for(int i : Y) assert(i != UNASSINED);
  assert(int(X.size()) == S);
  assert(int(Y.size()) == S);
  answer(C, X, Y);
}

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