# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
18354 | suhgyuho_william | Parrots (IOI11_parrots) | C++14 | 6 ms | 2024 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[])
{
int i,t;
t = 0;
for(i=0; i<N; i++) send(M[i]);
}
#include "decoder.h"
#include "decoderlib.h"
#include <algorithm>
using namespace std;
int cnt;
void decode(int N, int L, int X[]){
int i;
cnt++;
if(cnt == 1){
for(i=0; i<N; i++){
output(X[i]);
}
return;
}
i = 0;
while(i < L-1){
swap(X[i],X[i+1]);
i += 2;
}
for(i=0; i<N; i++) output(X[i]);
}
Compilation message (stderr)
# | 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... |