# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
64630 | gnoor | Parrots (IOI11_parrots) | C++17 | 10 ms | 2312 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 <cassert>
#include <cstdio>
void encode(int N, int M[])
{
assert(N<=32);
for (int i=0;i<N;i++) {
for (int j=0;j<8;j++) {
if (M[i]&(1<<j)) send(i*8+j);
}
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <cstdio>
int ans[70];
void decode(int N, int L, int X[])
{
int i, b;
for (int i=0;i<N;i++) ans[i]=0;
for(i=0; i<L; i++) {
b = X[i];
int pos=X[i]/8;
int off=X[i]%8;
ans[pos]^=(1<<off);
}
for (int i=0;i<N;i++) {
output(ans[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... |