# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65811 | asonetu | Parrots (IOI11_parrots) | C++14 | 6 ms | 1608 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 <stdio.h>
void encode(int N, int M[])
{
// int i;
// for(i=0; i<N; i++)
// send(M[i]);
for(int i=0; i<N; i++) {
int pos = i;
int val = M[i];
int sendVal = N*val + pos;
send(sendVal);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <stdio.h>
void decode(int N, int L, int X[])
{
// int i, b;
// for(i=0; i<L; i++) {
// b = X[i];
// output(b);
// }
int i, b;
int result[N];
for(i=0; i<L; i++) {
int pos = X[i] % N;
int val = X[i] / N;
printf("pos : %d, ", pos);
printf("val : %d\n", val);
result[pos] = val;
}
for(i=0; i<N; i++) {
printf("%d ", result[i]);
output(result[i]);
}
printf("\n");
}
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... |