# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602099 | vh50 | 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 <bits/stdc++.h>
#include "encoder.h"
#include "encoderlib.h"
using namespace std;
void encode(int N, int M[])
{
for(int i = 0; i < N; i++)
for(int j = 0; j < 3; j++)
for(int k = 0; k <= j; k++)
input((i << 4) + (M[i] >> 3 * j) & (1 << 3));
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
using namespace std;
void decode(int N, int L, int X[])
{
int marc[300], v[300];
sort(X, X + L);
for(int i = 0; i < L; i++)
marc[X[i]]++;
for(int i = 0; i < L; i++)
v[X[i] >> (1 << 3)] += X[i] & (1 << 3);
for(int i = 0; i < N; i++) output(v[i]);
}