# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
51822 | rondojim | Parrots (IOI11_parrots) | C++17 | 7 ms | 2240 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)
for(int j=0; j<8; ++j) if(M[i] & (1 << (8 - j - 1))) send(16 * i + 2 * j);
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
void decode(int N, int L, int X[]){
sort(X, X + L);
int res[N] = {0}, sum = 0;
for(int i=0; i<L; ++i) res[X[i] / 16] += (1 << (7 - (X[i] % 16) / 2));
for(int i=0; i<N; ++i) output(res[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... |