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 cur = 0;
for (int i = 0; i < N; i++){
int x = M[i];
for (int j = 0; j < 4; j++){
int curmask = cur | ( (x & 3) << 6);
send(curmask);
cur++;
x >>= 2;
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
bool cmp(int fi, int se){
return (fi & ((1<<6)-1)) < (se & ((1<<6)-1));
}
void decode(int N, int L, int X[]){
sort(X, X+L, cmp);
for (int i = 3; i < L; i += 4){
int ans = (X[i-3]>>6) | ((X[i-2]>>6) << 2) | ((X[i-1]>>6) << 4) | ((X[i]>>6) << 6);
output(ans);
}
}
# | 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... |