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>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
void encode(int n, int m[]) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < 8; j++) if ((m[i] >> j) & 1) {
send(i * 8 + j);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
int a[110];
void decode(int n, int l, int x[]) {
for(int i = 0; i < n; i++) a[i] = 0;
for(int i = 0; i < l; i++) {
int bit = x[i] % 8;
int pos = x[i] / 8;
a[pos] += (1 << bit);
}
for(int i = 0; i < n; i++) output(a[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... |