/**
 * @author n685
 * @brief
 * @date 2024-09-12 16:26:47
 *
 *
 */
#include "bits/stdc++.h"
#include "message.h"

#ifdef LOCAL
#include "dd/debug.h"
#else
#define dbg(...) 42
#define dbg_proj(...) 420
#define dbg_rproj(...) 420420
void nline() {}
void bar() {}
void start_clock() {}
void end_clock() {}
#endif

namespace rs = std::ranges;
namespace rv = std::views;

constexpr int N = 1025, Q = 66, LEN = 31, GOOD = 16;

void send_message(std::vector<bool> M, std::vector<bool> C) {
  dbg(1);
  M.push_back(true);
  M.resize(N);
  const std::vector<bool> m{std::move(M)}, c{std::move(C)};
  std::array<int, LEN> mx{};
  mx.fill(-1);
  for (int i = 0; i < LEN; ++i) {
    if (c[i]) {
      continue;
    }
    for (int j = 1;; ++j) {
      if (!c[(i + j) % LEN]) {
        mx[i] = j - 1;
        break;
      }
    }
  }
  dbg(mx);
  int ind = 0;
  std::vector<bool> arr(LEN);
  for (int i = 0; i < Q; ++i) {
    for (int j = 0; j < LEN; ++j) {
      if (c[j]) {
        continue;
      }
      if (i < mx[j]) {
        arr[j] = true;
      } else if (i == mx[j]) {
        arr[j] = false;
      } else if (ind < N) {
        arr[j] = m[ind++];
      }
    }
    send_packet(arr);
  }
}

std::vector<bool> receive_message(std::vector<std::vector<bool>> R) {
  dbg(2);
  const std::vector<std::vector<bool>> r{std::move(R)};

  std::array<int, LEN> nxt{};
  nxt.fill(-1);
  for (int i = 0; i < Q; ++i) {
    for (int j = 0; j < LEN; ++j) {
      if (nxt[j] == -1 && !r[i][j]) {
        nxt[j] = (j + (i + 1)) % LEN;
      }
    }
  }
  dbg(nxt);
  std::vector<bool> c(LEN, true);
  for (int i = 0; i < LEN; ++i) {
    int node = i;
    bool g = true;
    for (int j = 0; j < GOOD - 1; ++j) {
      node = nxt[node];
      if (node == -1 || node == i) {
        g = false;
        break;
      }
    }
    if (g && nxt[node] == i) {
      node = i;
      for (int j = 0; j < GOOD; ++j) {
        c[node] = false;
        node = nxt[node];
      }
      break;
    }
  }
  std::vector<bool> m;
  std::vector<bool> st(LEN);
  for (int i = 0; i < Q; ++i) {
    for (int j = 0; j < LEN; ++j) {
      if (c[j]) {
        continue;
      }
      if (st[j]) {
        m.push_back(r[i][j]);
      } else if (!r[i][j]) {
        st[j] = true;
      }
    }
  }
  while (!m.empty() && !m.back()) {
    m.pop_back();
  }
  m.pop_back();
  return m;
}