제출 #38603

#제출 시각아이디문제언어결과실행 시간메모리
38603ykmyou앵무새 (IOI11_parrots)C++14
81 / 100
7 ms2176 KiB
#include "encoder.h" #include "encoderlib.h" const int cand[] = { 128, 64, 32, 16, 8, 4, 2, 1 }; void encode(int N, int M[]) { for (int i = 0; i < N; i++) { int val = M[i]; for (int j = 0; j < 8; j++) { if (cand[j] <= val) { send(i * 8 + j); val -= cand[j]; } } } }
#include "decoder.h" #include "decoderlib.h" const int cand[] = { 128, 64, 32, 16, 8, 4, 2, 1 }; void decode(int N, int L, int X[]) { for (int i = 0; i < N; i++) { int val = 0; for (int j = 0; j < L; j++) { int b = X[j]; if (b / 8 == i) val += cand[b % 8]; } output(val); } }
#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...