Submission #1206277

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206277		Adomas08	Message (IOI24_message)	C++20	0 / 100	497 ms	848 KiB

message

#include "message.h"
#include <bits/stdc++.h>

using namespace std;

void send_message(std::vector<bool> M, std::vector<bool> C) {
  std::vector<bool> A(31, 0);
  vector <bool> used[31];
  vector <int> x;
  for (int i = 0; i < 31; i++){
    if (C[i] == 0) x.push_back(i);
  }
  x.push_back(x[0] + 31);
  int cur = 1;
  for (int i = 0; i < 31; i++){
    if (C[i] == 0){
        for (int j = 0; j < x[cur] - i; j++){
            used[i].push_back(1);
        }
        used[i].push_back(0);
        cur++;
    }
  }
  cur = 0;
  for (int i = 0; i < 31; i++){
    if (C[i] == 0){
     while (cur != M.size() && used[i].size() != 66){
        used[i].push_back(M[cur]);
        cur++;
     }
    }
    else{
        while (used[i].size() != 66){
        used[i].push_back(0);
     }
    }
  }

  for (int i = 0; i < 31; i++){
    while (used[i].size() != 66){
        used[i].insert(used[i].begin() + 0, 0);
    }
  }
        for (int i = 0; i < 66; i++){
            for (int j = 0; j < 31; j++){
                A[j] = used[j][i];
            }
            send_packet(A);
        }
}

std::vector<bool> receive_message(std::vector<std::vector<bool>> R) {
    vector <bool> C[31];
    for (int i = 0; i < 66; i++){
        for (int j = 0; j < 31; j++){
            C[j].push_back(R[i][j]);
        }
    }
    vector <bool> ans;
  int diff[31];
  for (int i = 0; i < 31; i++){
    diff[i] = 0;
    while (C[i].size() != 0 && C[i][0] == 0){
        C[i].erase(C[i].begin() + 0);
    }
    if (C[i].size() == 0){
        diff[i] = 0;
        continue;
    }
    while (C[i][0] == 1 && C[i].size() != 0){
        C[i].erase(C[i].begin() + 0);
        diff[i]++;
    }
    if (C[i].size() == 0){
        diff[i] = 0;
        continue;
    }
    C[i].erase(C[i].begin() + 0);
    }
  int theone;
  for (int i = 0; i < 31; i++){
     int cur = i;
     int depth = 0;
     while (depth != 16 && cur >= i){
        depth++;
        cur += diff[cur];
        cur %= 31;
     }
     if (depth == 16 && cur == i){
        theone = i;
        break;
     }
  }
  for (int cur = theone; cur < 31; cur += diff[cur]){
    for (auto u : C[cur]){
        ans.push_back(u);
    }
  }
  return ans;
}

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