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++){
int x = M[i];
for (int j = 0; j < 8; j++){
if (x & (1<<j)){
int curmask = i | (j << 5);
send(curmask);
}
}
}
}
#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 < N; i++)
ans[i] = 0;
for (int i = 0; i < L; i++){
ans[X[i]&((1<<5)-1)] |= (1<<(X[i]>>5));
}
for (int i = 0; i < N; i++)
output(ans[i]);
}
# | 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... |