제출 #51824

#제출 시각아이디문제언어결과실행 시간메모리
51824rondojim앵무새 (IOI11_parrots)C++17
81 / 100
8 ms2392 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 << (8 - j - 1))) 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[]){
	sort(X, X + L);
	int res[N] = {0};
  for(int i=0; i<L; ++i) res[X[i] / 8] += (1 << (7 - (X[i] % 8)));
	for(int i=0; i<N; ++i) output(res[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...