제출 #23602

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