# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906203 | Macker | Parrots (IOI11_parrots) | C++14 | 3 ms | 1324 KiB |
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[])
{
vector<int> v(N);
for (int i = 0; i < N; i++) {
v[i] = M[i];
}
int leni = (1 << 6);
int len = (1 << 2);
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
int a = (4 * i + j) * len;
int x = v[i] % len;
send(x + a);
v[i] /= len;
}
}
}
#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 leni = (1 << 6);
int len = (1 << 2);
sort(X, X + L);
for (int i = 0; i < N; i++) {
int res = 0;
for (int j = 0; j < 4; j++) {
int x = X[4 * i + j] % len;
res += x * (1 << 2 * j);
}
output(res);
}
}
Compilation message (stderr)
# | 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... |