# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
343878 | beksultan04 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 2615 ms | 24636 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.
int pp[10001],cnt=0;
int encode (int n, int x, int y) {
if (!cnt)
for (int i=0;i<(1<<12);++i)
if (__builtin_popcount(i) == 6)pp[cnt++]=i;
x = pp[x-1];
y = pp[y-1];
for (int i=11;i>=0;--i){
if ((x&(1<<i)) && !(y&(1<<i)))return i+1;
}
return 0;
}
int pp[10001],cnt=0;
int decode (int n, int q, int h) {
if (!cnt){
for (int i=31;i<(1<<12);++i)
if (__builtin_popcount(i) == 6)pp[cnt++]=i;
}
q = pp[q-1];
return (q&(1<<(h-1)));
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |