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[]){
for(int i = 0;i < N;i++){
int tmp = i,tmp2 = i,tmp3 = i;
tmp2 |= (1<<7);
tmp3 |= (1<<7);
tmp3 |= (1<<6);
for(int j = 4;j<7;j++){
if(M[i] & (1<<(j-4)))
tmp |= (1<<j);
}
for(int j = 4;j<6;j++){
if(M[i] & (1<<(j-1)))
tmp2 |= (1<<j);
}
for(int j = 4;j<6;j++){
if(M[i] & (1<<(j+1)))
tmp3 |= (1<<j);
}
send(tmp);
send(tmp2);
send(tmp3);
if(M[i] & (1<<7)){
send(tmp);
send(tmp2);
send(tmp3);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int ar[20];
bool done[256];
void decode(int N, int L, int X[]){
for(int i = 0;i<L;i++){
int p = 0;
for(int j = 0;j<4;j++){
if((1<<j) & X[i])
p |= (1<<j);
}
if(done[X[i]]){
ar[p] |= (1<<7);
continue;
}
int numb = 0;
if(!(X[i] & (1<<7))){
for(int j = 4;j<7;j++){
if(X[i] & (1<<j))
numb |= (1<<(j-4));
}
}else if(!(X[i] & (1<<6))){
for(int j = 4;j<6;j++){
if(X[i] & (1<<j))
numb |= (1<<(j-1));
}
}else{
for(int j = 4;j<6;j++){
if(X[i] & (1<<j))
numb |= (1<<(j+1));
}
}
ar[p] |= numb;
}
for(int i = 0;i<N;i++)
output(ar[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... |