제출 #67203

#제출 시각아이디문제언어결과실행 시간메모리
67203RezwanArefin01앵무새 (IOI11_parrots)C++17
34 / 100
6 ms2168 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { for(int i = 0; i < N; i++) send( (i << 8) | M[i] ); }
#include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]) { int a[N]; for(int i = 0; i < N; i++) a[X[i] >> 8] = X[i] & 255; 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...