제출 #602151

#제출 시각아이디문제언어결과실행 시간메모리
602151vh50앵무새 (IOI11_parrots)C++17
17 / 100
3 ms1068 KiB
#include <bits/stdc++.h> #include "encoder.h" #include "encoderlib.h" using namespace std; void encode(int N, int M[]) { for(int i = 0; i < N; i++) for(int j = 0; j < 3; j++) for(int k = 0; k <= j; k++) send((i << 3) + (((M[i] >> (3 * j)) & 7))); }
#include <bits/stdc++.h> #include "decoder.h" #include "decoderlib.h" using namespace std; void decode(int N, int L, int X[]) { int marc[300], v[300]; for(int i = 0; i < 270; i++) marc[i] = v[i] = 0; sort(X, X + L); for(int i = 0; i < L; i++) marc[X[i]]++; for(int i = 0; i < 256; i++) { if(!marc[i]) continue; v[i >> 3] += ((i & 7) << ((marc[i] - 1) * 3)); } for(int i = 0; i < N; i++) output(v[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...