제출 #220522

#제출 시각아이디문제언어결과실행 시간메모리
220522anonymous앵무새 (IOI11_parrots)C++14
81 / 100
13 ms1536 KiB
#include "encoder.h" #include "encoderlib.h" using namespace std; void encode(int N, int M[]) { int B = 0; for(int i=0; i<N; i++) { for (int j=0; j<8; j++) { if (M[i] & (1<<j)) {send(B);} B++; } } }
#include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]) { int freq[256]={}, B = 0; for (int i=0; i<L; i++) { freq[X[i]]++; } for (int i=0; i<N; i++) { int resi = 0; for (int j=0; j<8; j++) { if (freq[B]) {resi+=(1<<j);} B++; } output(resi); } }
#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...