제출 #900258

#제출 시각아이디문제언어결과실행 시간메모리
900258boyliguanhan앵무새 (IOI11_parrots)C++17
17 / 100
4 ms1836 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int N, int M[]) { int sum=0; for(int i = 0; i < N; i++) for(int j = 0; j < 4; j++) sum+=M[i]>>j*2&3; if(sum>6*N) { for(int i = 0; i < N; i++) M[i]=255-M[i]; send(0),send(0),send(0),send(0); } for(int i = 0; i < N; i++) for(int j = 0; j < 4; j++) for(int k = 0; k < (M[i]>>j*2&3); k++) send(i*4+j); }
#include "decoder.h" #include "decoderlib.h" void decode(int N, int L, int X[]) { int res[N]{},cnt[256]{}, inv=0; for(int i = 0; i < L; i++) { cnt[X[i]]++,res[X[i]/4] += 1 << (X[i]&3)*2; if(cnt[X[i]]==4) res[X[i]/4]=0,inv=1; } for(auto i: res) output(inv?255-i: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...