제출 #504800

#제출 시각아이디문제언어결과실행 시간메모리
504800abra_stone앵무새 (IOI11_parrots)C++14
81 / 100
3 ms1172 KiB
#include "encoder.h" #include "encoderlib.h" void encode(int n, int M[]) { int i, j; for (i = 0; i < n; i++) { int m = M[i]; for (j = 0; j < 8; j++) { int t = i * 8 + j; if (m % 2) send(t); m /= 2; } } }
#include "decoder.h" #include "decoderlib.h" #define N 70 int ans[N]; void decode(int n, int L, int X[]) { int i; for (i = 0; i < n; i++) ans[i] = 0; for (i = 0; i < L; i++) { ans[X[i] / 8] += 1 << X[i] % 8; } for (i = 0; i < n; i++) { output(ans[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...