| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 717717 | EntityPlantt | Parrots (IOI11_parrots) | C++14 | 1 ms | 1028 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"
void encode(int n, int m[]) {
for (int i = 0; i < n; i++) {
send((i << 8) | m[i]);
}
}#include "decoder.h"
#include "decoderlib.h"
#include <vector>
void decode(int n, int l, int x[]) {
std::vector <int> m(n);
for (int i = 0; i < l; i++) {
m[x[i] >> 8] = m[x[i] & 255];
}
for (int &i : m) {
output(i);
}
}| # | 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... | ||||
