This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |