제출 #508321

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