제출 #595836

#제출 시각아이디문제언어결과실행 시간메모리
595836proma앵무새 (IOI11_parrots)C++17
17 / 100
1 ms896 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { int x = 0; for (int i = N - 1; i >= 0; i --) { x += M[i] * (1 << (N-1-i)); } send(x); }
#include "decoder.h" #include "decoderlib.h" #include <vector> #include <algorithm> void decode(int N, int L, int X[]) { std::vector <int> res; for (int i = 0; i < N; i ++) { res.push_back(X[0] % 2); X[0] /= 2; } reverse(res.begin(), res.end()); for (auto i: res) output(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...