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"
void encode(int n, int m[]){
int k = 1;
for (int i = 0; i < n; ++i){
send(k * m[i]); k *= 2;
}
}
#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;
void decode(int n, int l, int x[]){
vector<bool> v(n);
for (int i = 0; i < l; ++i){
if (x[i] == 0) continue;
int k = 0;
while (x[i] > 1) x[i] /= 2, k++;
v[k] = true;
}
for (int i = 0; i < n; ++i) output(v[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... |