# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920509 | Pannda | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 2943 ms | 25080 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 <bits/stdc++.h>
using namespace std;
bool computed = false;
vector<int> f;
void compute() {
if (computed) return;
computed = true;
for (int mask = 0; mask < (1 << 12); mask++) {
if (__builtin_popcount(mask) == 6) {
f.push_back(mask);
}
}
}
int encode(int n, int x, int y) {
compute();
x = f[x];
y = f[y];
for (int i = 0; i < 12; i++) {
if ((x >> i & 1) && !(y >> i & 1)) {
return i + 1;
}
}
assert(false);
return -1;
}
#include <bits/stdc++.h>
using namespace std;
bool computed = false;
vector<int> f;
void compute() {
if (computed) return;
computed = true;
for (int mask = 0; mask < (1 << 12); mask++) {
if (__builtin_popcount(mask) == 6) {
f.push_back(mask);
}
}
}
int decode(int n, int q, int h) {
compute();
q = f[q];
h--;
return q >> h & 1;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |