#include "mpc.h"

int precalc(int n,int m){
  return n + m + 3;
}

bool transmit(player &player, int round,int position){
  constexpr int M = 2200;
  const int msg = player.last_message;
  auto A = [&](int i) -> int & {
    return player.memory[i];
  };
  
  // waiting to be sent, base 2^J
  constexpr int J = 30;
  auto wait = [&](int i) -> int & {
    return A(M + i);
  };
  if (round == 1) {
    for (int e = 0; e < M; ++e) if (A(e)) {
      wait(e/J) |= 1 << (e%J);
    }
  }
  
  auto receive = [&](int e) -> void {
    A(e) += 1;
    for (int f = e; A(f) >= 2; ++f) {
      A(f) -= 2;
      A(f + 1) += 1;
    }
    wait(e/J) += 1 << (e%J);
    for (int i = e/J; wait(i) >= 1 << J; ++i) {
      wait(i) -= 1 << J;
      wait(i + 1) += 1;
    }
  };
  auto send = [&](int e) -> int {
    if (wait(e/J) & 1 << (e%J)) {
      wait(e/J) ^= 1 << (e%J);
      return 1;
    } else {
      return 0;
    }
  };
  
  const int d = round - position - 1;
  if (d >= 0) {
    if (msg) {
      receive(d);
    }
    return send(d);
  } else {
    // send highest every L rounds
    constexpr int L = 12;
    const int phase = (round - 1) % L;
    int &posRec = A(4095);
    int &posSen = A(4094);
    if (phase == 0) {
      if (msg) {
        receive(posRec);
      }
      posRec = 0;
      posSen = -1;
      for (int i = (M-1)/J; i >= 0; --i) if (wait(i)) {
        posSen = i * J + (31 - __builtin_clz(wait(i)));
        break;
      }
    } else {
      if (msg) {
        posRec |= 1 << (phase - 1);
      }
    }
    if (~posSen) {
      if (phase < L - 1) {
        return posSen >> phase & 1;
      } else {
        return send(posSen);
      }
    } else {
      return 0;
    }
  }
}