# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
795963 | hgmhc | Parrots (IOI11_parrots) | C++17 | 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 "decoder.h"
#include "decoderlib.h"
static const int N = 20;
static int ans[N];
void decode(int n, int l, int x[])
{
for (int k = 0; k < l; ++k) {
int i = x[k]&0b1111;
int j = x[k]>>4&0b11;
int v = x[k]>>6&0b11;
ans[i] |= v<<(2*j);
}
for (int i = 0; i < n; ++i)
output(ans[i]);
}
// ans[i] < 2^8
#include "decoder.h"
#include "decoderlib.h"
static const int N = 20;
static int ans[N];
void decode(int n, int l, int x[])
{
for (int k = 0; k < l; ++k) {
int i = x[k]&0b1111;
int j = x[k]>>4&0b11;
int v = x[k]>>6&0b11;
ans[i] = v<<(2*j);
}
for (int i = 0; i < n; ++i)
output(ans[i]);
}
// ans[i] < 2^8