제출 #134622

#제출 시각아이디문제언어결과실행 시간메모리
134622turbat앵무새 (IOI11_parrots)C++14
81 / 100
8 ms2032 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 < 8;j++) if (M[i] & 1<<j){ int s = i; for (int o = 0;o < 3;o++) if (j & 1<<o) s |= 1<<(5 + o); send(s); } } }
#include <bits/stdc++.h> #include "decoder.h" #include "decoderlib.h" using namespace std; void decode(int N, int L, int X[]){ vector <int> v(N); for(int i = 0;i < L;i++) { int idx = 0; for (int j = 0;j < 5;j++) idx |= ((1<<j) & X[i]); X[i] >>= 5; v[idx] |= 1<<X[i]; } 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...