제출 #676628

#제출 시각아이디문제언어결과실행 시간메모리
676628nvujica앵무새 (IOI11_parrots)C++14
0 / 100
2 ms1048 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 << 3) + j); } } }
#include "decoder.h" #include "decoderlib.h" void decode(int n, int l, int x[]){ int m[n]; for(int i = 0; i < l; i++){ m[x[i] & 248] |= (1 << (x[i] & 7)); } for(int i = 0; i < n; i++){ output(m[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...