제출 #23623

#제출 시각아이디문제언어결과실행 시간메모리
23623Hiasat앵무새 (IOI11_parrots)C++14
17 / 100
5 ms2096 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; void encode(int N, int M[]) { for (int i = 0; i < N; i++) { for (int bit = 0; bit <= 0 ; bit++) { int cur = 0; int rem = i; for (int j = 6 ; j >= 0 ; j--) { if (rem >= (1 << j)) { cur = cur | ( 1 << j); rem -= (1 << j); } } cur = cur | ((M[i] & (1 << bit)) ? (1 << 7) : 0); send(cur); } } }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; int ans[310]; void decode(int N, int L, int X[]) { for(int i=0; i<L; i++) { bool bit = (X[i] & (1 << 7)); int nw = X[i] - (1 << 7)*bit; ans[nw] = bit; } for (int i = 0; i < N; ++i){ output(ans[i] * 1); } }
#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...