제출 #59191

#제출 시각아이디문제언어결과실행 시간메모리
59191fallingstar앵무새 (IOI11_parrots)C++17
81 / 100
11 ms3000 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] >> j) & 1) send((i << 3) | j); }
#include "decoder.h" #include "decoderlib.h" void decode(int n, int k, int a[]) { int b[n] = {}; for (int i = 0; i < k; ++i) b[a[i] >> 3] |= 1 << (a[i] & 7); for (int i = 0; i < n; ++i) output(b[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...