#include <iostream>
#include <vector>
#include "message.h"
using namespace std;

void send_message(std::vector<bool> M, std::vector<bool> C) {
	int S = M.size();
	std::vector<int> pos;
	for (int i = 0; i < 30; i ++) {
		// cout << "ok" << endl;
		if (!pos.size()) {
			send_packet(vector<bool>(31, C[i]));
			if (!C[i]) pos.push_back(i);
		}
		else {
			std::vector<bool> tmp(31);
			int L = pos.size(), j;
			for (j = 0; j < L && i + j < 30; j ++) {
				tmp[pos[j]] = C[i + j];
				if (!C[i + j]) pos.push_back(i + j);
			}
			send_packet(tmp), i = i + j - 1;
		}
	}
	if (!C[30]) pos.push_back(30);

	std::vector<bool> len(31);
	for (int i = 0; i < 16; i ++)
		len[pos[i]] = S >> i & 1;

	send_packet(len);
	for (int i = 0; i < S; i += 16) {
		std::vector<bool> tmp(31);
		for (int j = i; j < min(i + 16, S); j ++)
			tmp[pos[j - i]] = M[j];
		send_packet(tmp);
	}
}
std::vector<bool> receive_message(std::vector<vector<bool>> R) {
	// cout << "OK" << endl;
	std::vector<int> pos;
	int sum = 0, pt = 0, i;
	for (i = 0; i < R.size(); i ++) {
		if (pt == 30) break;
		if (!pos.size()) {
			int C[2] = {0};
			for (int j = 0; j < 31; j ++)
				C[R[i][j]] ++;
			if (C[0] > C[1]) pos.push_back(i);
			sum += C[1] > C[0], pt ++;
		} else {
			int L = pos.size(), j;
			for (j = 0; j < L && pt + j < 30; j ++)
				if (!R[i][pos[j]])
					pos.push_back(pt + j);
				else sum ++;
			pt += j;
		}
	}
	if (sum == 15) pos.push_back(30);

	int S = 0;
	for (int j = 0; j < 16; j ++)
		S |= (R[i][pos[j]] << j);
	i ++;

	std::vector<bool> res;
	for (; i < R.size(); i ++)
		for (auto j : pos)
			res.push_back(R[i][j]);
	while (res.size() > S) res.pop_back();

	return res;
}