| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 851 | tncks0121 | Parrots (IOI11_parrots) | C++98 | 7 ms | 2144 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++) if(M[i]) send(i);
}#include "decoder.h"
#include "decoderlib.h"
int result[100];
void decode (int N, int L, int X[]) {
for(int i = 0; i < N; i++) result[i] = 0;
for(int i = 0; i < L; i++) result[X[i]] = 1;
for(int i = 0; i < N; i++) output(result[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... | ||||
