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>
using namespace std;
#include "encoder.h"
#include "encoderlib.h"
void haz(int x, int pos){
// cout<<x<<" : "<<pos<<"\n";
send((x<<6)+pos);
}
void encode(int N, int M[])
{
for(int i = 0; i < N; i++){
int x = M[i];
for(int h = 0; (1<<h)<=x; h++){
if((x>>h)&1){
int r=0;
if((h>>2)&1){
r=4;
haz(h-r,i);
}
haz(h-r,i);
}
}
}
return;
}
#include<bits/stdc++.h>
using namespace std;
#include "decoder.h"
#include "decoderlib.h"
int num[10][200];
void decode(int N, int L, int X[])
{
for(int i=0; i<L; i++) {
int x = X[i];
// cout<<x<<" ";
num[(x>>6)][((x|192)^192)]++;
}
// cout<<"\n";
for(int i = 0; i < N; i++){
int x = 0;
for(int h = 0; h < 8; h++){
if(num[h][i]&1){
x+=(1<<h);
}
if(num[h][i]>1){
x+=(1<<h)+4;
}
}
// cout<<x<<" ";
output(x);
}
}
# | 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... |