#include "mpc.h"

/*
  < 2^M + ... + 2^M + 2^(M-1) + 2^(M-2) + 2^(M-3) + ...
  < 2^M (ceil(log_2(N)) + 2)
*/

// heard statement update
int N, M, logN, loglogN;

int precalc(int n,int m){
  N = n;
  M = m;
  for (logN = 0; !(N <= 1 << logN); ++logN) {}
  for (loglogN = 0; !(logN + 2 <= 1 << loglogN); ++loglogN) {}
  return N + M + loglogN;
}

bool transmit(player &player, int round,int position){
  const int msg = player.last_message;
  auto A = [&](int i) -> int & {
    return player.memory[i];
  };
  // to send early, in base 2^J
  constexpr int J = 30;
  auto B = [&](int i) -> int & {
    return player.memory[2200 + i];
  };
  
  auto addA = [&](int e, int val) -> void {
    A(e) += val;
    for (int f = e; A(f) >= 2; ++f) {
      A(f + 1) += A(f) / 2;
      A(f) %= 2;
    }
  };
  auto addB = [&](int e, int val) -> void {
    B(e/J) += val << (e%J);
    for (int i = e/J; B(i) >= 1 << J; ++i) {
      B(i + 1) += B(i) >> J;
      B(i) &= ((1 << J) - 1);
    }
  };
  
  if (round == 1) {
    // position = logN + 1: e >= M - 1
    for (int e = M - (position - logN); e < M; ++e) {
      A(e) = 0;
      addB(e, 1);
    }
  }
  
  const int d = round - position - 1;
  if (d >= 0) {
    if (msg) addA(d, 1);
    if (position == N) return 0;
    const int a = A(d);
    A(d) = 0;
    return a;
  } else {
    // d = -logN: e = M
    const int e = d - (-logN) + M;
    if (e >= 0) {
      if (msg) (position == N) ? addA(e, 1) : addB(e, 1);
      if (position == N) return 0;
      const int b = B(e/J) >> (e%J) & 1;
      B(e/J) &= ~(1 << (e%J));
      return b;
    } else {
      return 0;
    }
  }
}