Submission #1140374

#TimeUsernameProblemLanguageResultExecution timeMemory
1140374josephtenorioParrots (IOI11_parrots)C++20
52 / 100
2 ms840 KiB
#include "encoder.h"
#include "encoderlib.h"
#include <bits/stdc++.h>

using namespace std;

void encode(int N, int M[]) {
  int sup = 16 - 1;
  int enviar = 0;
  for (int t1 = 0; t1 < N; t1 ++) {
    for (int t2 = 0; t2 < 8; t2 ++) {
      enviar = sup;
      enviar <<= 3;
      enviar += t2;
      enviar <<= 1;
      if (M[t1] & (1 << t2)) {
        enviar += 1;
      }
      send(enviar);
    }
    sup --;
  }
  return ;
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>

using namespace std;


void decode(int N, int L, int X[]) {
  vector<int> ns(L);
  for (int t1 = 0; t1 < L; t1 ++) {
    ns[t1] = X[t1];
  }
  sort(ns.rbegin(), ns.rend());
  for (int t1 = 0; t1 < N; t1 ++) {
    int mes = 0;
    for (int t2 = 0; t2 < 8; t2 ++) {
      mes += ns[t1*8+t2] % 2;
      mes <<= 1;
    }
    output(mes >> 1);
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...