# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794920 | khshg | 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[]) {
if(N <= 32) {
for(int i = 0; i < N; ++i) {
for(int j = 0; j < 8; ++j) {
if(((M[i] >> j) & 1)) {
send(i + (j << 5));
}
}
}
return;
}
for(int i = 0; i < N; ++i) {
for(int j = 0; j < 4; ++j) {
int B = (M[i] >> (6 - 2 * j));
B &= 3;
while(B--) send(j + (i << 2));
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[]) {
if(N <= 32) {
vector<int> ans(N);
for(int i = 0; i < L; ++i) {
ans[X[i] % (1 << 5)] ^= (1 << (X[i] >> 5));
}
for(int i = 0; i < N; ++i) {
output(ans[i]);
}
return;
}
vector<int> ans(N);
for(int i = 0; i < L; ++i) {
ans[(X[i] >> 2)] += (1 << (2 * (3 - (X[i] & 3)));
}
for(int i = 0; i < N; ++i) {
output(ans[i]);
}
}