제출 #223974

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