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 k=1;
for(int i=0; i<N; i++)
{
for(int bit=0; bit<8; bit++)
{
if(M[i]&(1<<bit) and k&1)send(k), k++;
else if(M[i]&(1<<bit)) k++,send(k), k++;
else if(k&1) k++, send(k), k++;
else send(k), k++;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[])
{
sort(X, X+L);
for(int i=0; i<L;)
{
int ans=0;
for(int j=0; j<8; j++, i++)
{
//cout<<i<<' '<<X[i]<<endl;
if(X[i]&1) ans+=(1<<j);
}
output(ans);
//cout<<ans<<' '<<endl;
}
}
# | 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... |