Submission #310778

#TimeUsernameProblemLanguageResultExecution timeMemory
310778LucaDantas앵무새 (IOI11_parrots)C++17
0 / 100
3 ms1544 KiB
#include "encoder.h" #include "encoderlib.h" #include<cstdio> void encode(int N, int M[]) { for(int i = 0; i < N; i++) { for(int bit = 0; bit < 8; bit++) if(M[i]&(1<<bit)) send(8*i+bit); } }
#include "decoder.h" #include "decoderlib.h" #include<cstdio> #include<cstring> #include<algorithm> int BIT[10000]; void decode(int N, int L, int X[]) { std::sort(X, X+N); memset(BIT, 0, sizeof BIT); for(int i = 0; i < L; i++) BIT[X[i]] = 1; for(int i = 0; i < N; i++) { int here = 0; for(int bit = 0; bit < 8; bit++) { if(BIT[8*i+bit]) here += (1 << bit); } output(here); } }
#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...