제출 #51819

#제출 시각아이디문제언어결과실행 시간메모리
51819rondojim앵무새 (IOI11_parrots)C++17
0 / 100
13 ms2496 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]){ for(int i=0; i<N; ++i) for(int j=7; j>=0; --j) send(2 * i + ((M[i] & (1<<j)) != 0)); }
#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 sum = 0; for(int i=0; i<L; ++i){ sum += ((1 << (8 - (i % 8 + 1))) * (X[i] - (1 << i))); if(i % 8 == 7){ output(sum); sum = 0; } } }
#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...