| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 234046 | Nodir_Bobiev | Parrots (IOI11_parrots) | C++14 | 10 ms | 1536 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 <algorithm>
void encode(int N, int M[])
{
for(int i=0; i<N; i++){
send(M[i]+((i+1)*2));
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
void decode(int N, int L, int X[])
{
std::sort( X, X+L );
for(int i=0; i<L; i++) {
output(X[i]-((i+1)*2));
}
}| # | 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... | ||||
