Submission #1245523

#	Time	Username	Problem	Language	Result	Execution time	Memory
1245523		CyberCow	Message (IOI24_message)	C++20	0 / 100	0 ms	840 KiB

message

#include "message.h"
#include <bits/stdc++.h>
using namespace std;

void send_message(vector<bool> M, vector<bool> C) {
  vector<bool> A(31, 0);
  vector<bool> B(31, 1);
  vector<int> ind;
  int qaq1 = 16, qaq2 = 15;
  for (int i = 0; i < C.size(); i++)
  {
    if(qaq1 == 16 || qaq1 == 15)
    {
      if(C[i])
      {
        if(qaq1 && qaq2)
        {
          qaq2--;
          send_packet(B);
        }
      }
      else
      {
        if(qaq1 && qaq2)
        {
          qaq1--;
          send_packet(A);
        }
      }
    }
    else
    {
      if(qaq1 && qaq2)
      {
        vector<bool> nordzev(31, 0);
        vector<int> blbl;
        int ogt = 0;
        for (int j = 0; j < 31; j++)
        {
          if(j >= 31 - qaq1 - qaq2)
          {
            blbl.push_back(C[j]);
          }
        }
        int shutov1 = 0, shutov2 = 0;
        for (int j = 0; j < 31; j++)
        {
          if(ogt + qaq1 == 16)break;
          if(C[j] == 0)
          {
            nordzev[j] = blbl[ogt];
            if(blbl[ogt] == 0)
            {
              shutov1++;
            }
            else
            {
              shutov2++;
            }
            ogt++;
          }
        }
        qaq1 -= shutov1;
        qaq2 -= shutov2;
        send_packet(nordzev);
      }
    }
  }
  for (int i = 0; i < 31; i++)
  {
    if(C[i] == 0)ind.push_back(i);
  }
  int hanel = 0;
  while (M.size() % 16)
  {
    M.push_back(0);
    hanel++;
  }
  vector<bool> harc (31, 0);
  for (int i = 0; i < M.size(); i+=16)
  {
    for (int j = 0; j < 16; j++)
    {
      if(M[i + j])
      {
        harc[ind[j]] = 1;
      }
      else
      {
        harc[ind[j]] = 0;
      }
    }
    send_packet(harc);
  }
  vector<bool> verjin(31, 0);
  for (int i = 0; i < hanel; i++)
  {
    verjin[ind[i]] = 1;
  }
  send_packet(verjin);
}

vector<bool> receive_message(vector<vector<bool>> R) {
  vector<int> C;
  int Cqan = 0, Cqan1 = 0, minchev = 0;
  for (int i = 0; i < R.size(); i++)
  {
    if(Cqan <= 1)
    {
      int qan = 0, qan1 = 0;
      for (int b = 0; b < R[i].size(); b++)
      {
        if(R[i][b])
        qan1++;
        else
        qan++;
      }
      if(qan > qan1)
      {
        C.push_back(0);
        Cqan++;
      }
      else
      {
        C.push_back(1);
        Cqan1++;
      }
    }
    else
    {
      vector<int> avel;
      for (int j = 0; j < C.size(); j++)
      {
        if(C[j] == 0)
        {
          avel.push_back(R[i][j]);
        }
      }
      for (int j = 0; j < avel.size(); j++)
      {
        C.push_back(avel[j]);
        if(avel[j] == 0)Cqan++;
        else Cqan1++;
      }
    }
    minchev = i;
    if(Cqan >= 16 || Cqan1 >= 15)break;;
  }
  while (C.size() < 31)
  {
    if(Cqan == 16)
    C.push_back(1);
    else
    C.push_back(0);
  }
  while (C.size() > 31)
  {
    C.pop_back();
  }
  
  vector<bool> ans;
  for (int i = minchev + 1; i < R.size() - 1; i++)
  {
    for (int j = 0; j < R[i].size(); j++)
    {
      if(C[j] == 0)
      ans.push_back(R[i][j]);
    }
  }
  for (int i = 0; i < 31; i++)
  {
    if(C[i] == 0 && R.back()[i] == 1)
    ans.pop_back();
  }
  return ans;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 90