Submission #919924

#TimeUsernameProblemLanguageResultExecution timeMemory
919924mariaclaraParrots (IOI11_parrots)C++17
81 / 100
3 ms1332 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((1 << j) & M[i]) // se o bit tá ativo send(i*8 + j); }
#include<bits/stdc++.h> #include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]) { int M[N]; memset(M, 0, sizeof(M)); for(int i = 0; i < L; i++) M[X[i]/8] += (1 << (X[i]%8)); 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...