제출 #31744

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