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 < 4 * N; i++) {
int c = M[i / 4] >> ((3 - (i % 4)) * 2) & 3;
for(int j = 0; j < c; j++)
send(i);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[]) {
int a[N * 4];
memset(a, 0, sizeof a);
for(int i = 0; i < L; i++)
a[X[i]]++;
for(int i = 0; i < N; i++) {
int num = 0;
for(int j = i * 4; j < (i + 1) * 4; j++)
num = num * 4 + a[j];
output(num);
}
}
# | 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... |