제출 #61760

#제출 시각아이디문제언어결과실행 시간메모리
61760Vahan앵무새 (IOI11_parrots)C++17
81 / 100
12 ms2328 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { int a=0; for(int i=0; i<N; i++) { int y=M[i]; for(int j=a;j<=a+7;j++) { if(y%2==1) send(j); y/=2; } a+=8; } }
#include "decoder.h" #include "decoderlib.h" int v[300]; void decode(int N, int L, int X[]) { for(int i=0;i<=255;i++) v[i]=0; for(int i=0; i<L; i++) v[X[i]]++; int a=0; for(int i=0;i<N;i++) { int b=0; int p=1; for(int j=a;j<=a+7;j++) { b+=p*v[j]; p*=2; } output(b); a+=8; } }
#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...