| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 386912 | godwind | Parrots (IOI11_parrots) | C++14 | 3 ms | 1264 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 <vector>
using namespace std;
void encode(int N, int M[])
{
for (int i = 0; i < N; ++i) {
send(M[i] * 16 + i);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <vector>
using namespace std;
void decode(int n, int L, int X[])
{
vector<int> ans(n);
for (int i = 0; i < L; ++i) {
ans[X[i] % 16] = X[i] / 16;
}
for (int i = 0; i < n; ++i) {
output(ans[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... | ||||
