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 <bits/stdc++.h>
using namespace std;
void encode(int N, int M[])
{
for (int i = 0; i < N; ++i)
for (int j = 0; j < 8; ++j)
if((M[j]>>j)&1)send(((i*8+j)<<1)+1);
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
int ans[100];
void decode(int N, int L, int X[])
{
for(int i=0; i<L; i++) {
assert(X[i]&1);
X[i]>>=1;
ans[X[i]/8]|=(1<<(X[i]%8));
}
for (int i = 0; i < N; ++i)
output(ans[N]);
}
# | 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... |