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){
int x = b;
if (idx < 10) x = x*10 + idx;
else x = x*100 + idx;
return x;
}
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 + 1,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 < L; i++){
int x = X[i];
int A = 0,B = 0;
if (x < 100) A = x/10,B = x%10;
else A = x/100,B = x - A*100;
yy[B] |= (1<<(A - 1));
}
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... |