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;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
void encode(int N, int M[])
{
int len = (1 << 4);
for (int i = 0; i < N; i++) {
int a = (2 * i) * len;
int x = M[i] / len;
send(x + a);
a = (2 * i + 1) * len;
x = M[i] % len;
send(x + a);
}
}
#include "decoder.h"
#include "decoderlib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
void decode(int N, int L, int X[])
{
int len = (1 << 4);
sort(X, X + L);
for (int i = 0; i < N; i++) {
int x = (X[i * 2] % len) * len;
int y = (X[i * 2 + 1] % len);
output(x + y);
}
}
# | 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... |