제출 #705856

#제출 시각아이디문제언어결과실행 시간메모리
705856tht2005앵무새 (IOI11_parrots)C++17
81 / 100
3 ms1228 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" #include <vector> void decode(int N, int L, int X[]) { std::vector<int> res(N, 0); for(int i = 0; i < L; ++i) { int j = X[i] >> 3, k = X[i] & 7; res[j] |= 1 << k; } for(int i = 0; i < N; ++i) { output(res[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...