제출 #118282

#제출 시각아이디문제언어결과실행 시간메모리
118282MAMBA앵무새 (IOI11_parrots)C++11
0 / 100
5 ms1536 KiB
#include "encoder.h"
#include "encoderlib.h"

void encode(int N, int M[]) {
  for (int i = 0; i < N; i++)
  for (int j = 0; j < 8; j++)
    if ((M[i] >> j) & 1) send((i << 3) + j);
}
#include "decoder.h"
#include "decoderlib.h"

bool mark[1000];
void decode(int N, int L, int X[]) {
  for (int i = 0; i < L; i++) mark[X[i]] = true;
  for (int i = 0; i < N; i++) {
    int res = 0;
    for (int j = 0; j < 8; j++)
      if (mark[(i << 3) + j]) res += (1 << j);
    output(res);
  }
}
#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...