제출 #223984

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

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

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