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++){
for(int j = 0; j < 8; j++){
if(1 << j & M[i]){
send((i << 3) + j);
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[]){
vector<bool>bit(N << 3, false);
for(int i = 0; i < L; i++){
bit[X[i]] = true;
}
for(int i = 0; i < N; i++){
int ans = 0;
for(int j = 0; j < 8; j++){
if(bit[(i << 3) + j]){
ans |= 1 << j;
}
}
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... |