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 "encoder.h"
#include "encoderlib.h"
#include<bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
int id = 0;
for(int i=0; i<N; i++){
for(int j = 0; j<8; j++){
//cout<<M[i]<<" "<<bitset<8>(M[i] & (1<<j))<<endl;
int v= ((id<<1)|((M[i] & (1<<j))>>j));
//cout<<bitset<8>(v)<<endl;
send(v);
id++;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
vector<int> v(L);
for(int i = 0; i<L; i++){
v[i] = X[i];
}
sort(v.begin(), v.end());
//cout<<"decoding"<<endl;
for(int i = 0; i<N; i++){
int res= 0;
for(int j = 0; j<8; j++){
//cout<<bitset<8>((v[i*8 + j]&1)<<j)<<endl;
res += ((v[i*8 + j]&1)<<j);
}
output(res);
}
}
# | 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... |