제출 #1109060

#제출 시각아이디문제언어결과실행 시간메모리
1109060m_bezrutchka앵무새 (IOI11_parrots)C++14
81 / 100
4 ms1656 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] & (1 << j)) send(8 * i + j);
    }
  }
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;

void decode(int N, int L, int X[])
{
  vector<int> val(N);
  for (int i = 0; i < L; i++) {
    int bit = X[i] % 8;
    int pos = X[i] / 8;
    val[pos] += (1 << bit);
  }
  for (int i = 0; i < N; i++) {
    output(val[i]);
  }
}
#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...