# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345782 | casperwang | Parrots (IOI11_parrots) | C++14 | 0 ms | 0 KiB |
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++) {
if (n > 32) {
for (int j = 0; j < 4; j++) {
int id = i * 4 + j;
int val = ((M[i]&(1<<(j*2))>0) + 2 * ((M[i]&(1<<(j*2+1)))>0);
for (int k = 0; k < val; k++)
send(id);
}
} else {
for (int j = 0; j < 8; j++) {
int id = i * 8 + j;
int val = (M[i]&(1<<j))>0;
if (val) send(id);
}
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[]) {
vector <int> ans(N);
for (int i = 0; i < L; i++) {
int id = X[i];
if (n > 32) {
int j = id / 4, k = id % 4;
ans[j] += (1<<(k*2));
} else {
int j = id / 8, k = id % 8;
ans[j] += (1<<k);
}
}
for (int i = 0; i < N; i++) {
output(ans[i]);
}
}