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[])
{
int cur = 0;
for(int i = 0; i < N; i++) {
int x = M[i];
int p = x % 4;
x /= 4;
int q = x % 4;
x /= 4;
int r = x % 4;
x /= 4;
int s = x % 4;
x /= 4;
while(p--) send(cur);
++cur;
while(q--) send(cur);
++cur;
while(r--) send(cur);
++cur;
while(s--) send(cur);
++cur;
}
}
#include "decoder.h"
#include "decoderlib.h"
#include "bits/stdc++.h"
using namespace std;
void decode(int N, int L, int X[])
{
int cnt[300];
memset(cnt, 0, sizeof cnt);
for(int i = 0; i < L; i++) {
cnt[X[i]] += 1;
}
for(int i = 0; i < 4 * N; i += 4) {
output(cnt[i] + cnt[i+1] * 4 + cnt[i+2] * 16 + cnt[i+3] * 64);
}
}
# | 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... |