제출 #24743

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