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 <bits/stdc++.h>
#define ll long long
#define pb push_back
#include "encoder.h"
#include "encoderlib.h"
//#include "parrotslib.h"
using namespace std;
const int MN = 3e5 + 5;
int xx[300005];
int get(int b,int idx){
return idx * 10 + b;
}
void encode(int N, int M[]){
int id = -1;
for (int i = 0; i < N; i++){
int x = M[i];
for (int j = 8; j >= 0; j--){
if (((x >> j) & 1)){
xx[++id] = get(j,i);
}
}
}
for (int i=0;i<=id;i++)
send(xx[i]);
}
#include <bits/stdc++.h>
#include "decoder.h"
#include "decoderlib.h"
#define ll long long
#define pb push_back
//#include "parrotslib.h"
using namespace std;
//const int MN = 3e5 + 5;
int yy[300005];
void decode(int N, int L, int X[]){
for (int i=0;i<N;i++)
yy[i] = 0;
for (int i = 0; i < L; i++){
int x = X[i];
int A = x%10,B = x/10;
yy[B] |= (1<<A);
}
for (int i=0;i<N;i++)
output(yy[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... |