제출 #248612

#제출 시각아이디문제언어결과실행 시간메모리
248612davi_bart앵무새 (IOI11_parrots)C++14
88 / 100
15 ms1792 KiB
#include <bits/stdc++.h> #include "encoder.h" #include "encoderlib.h" using namespace std; typedef long long ll; void encode(int N,int M[]){ if(N<=32){ for(int i=0;i<N;i++){ for(int j=0;j<8;j++){ if(M[i]&(1<<j))send(i+(j<<5)); } } return; } for(int i=0;i<N;i++){ for(int j=0;j<8;j++){ if(M[i]&(1<<j)){ send(i+((j/2)<<6)); if(j%2==1)send(i+((j/2)<<6)); } } } }
#include <bits/stdc++.h> #include "decoder.h" #include "decoderlib.h" using namespace std; typedef long long ll; void decode(int N,int L,int X[]){ vector<int> sol(N); if(N<=32){ for(int i=0;i<L;i++){ sol[X[i]&31]+=(1<<(X[i]>>5)); } for(int i=0;i<N;i++){ output(sol[i]); } return; } for(int i=0;i<L;i++){ sol[X[i]&63]+=(1<<(2*(X[i]>>6))); } for(int i=0;i<N;i++){ output(sol[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...