# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95928 | Bodo171 | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 1281 ms | 81160 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 lsb(int x)
{
return ((x^(x-1))&x);
}
int norm[2000];
int encode (int n, int x, int y) {
for(int i=0;i<=9;i++)
norm[(1<<i)]=i+1;
return norm[lsb((x^y))]+10*((lsb((x^y))&x)!=0);
}
int decode (int n, int q, int h) {
int ret=0;
if(h>10)
{
h-=11;
if((q&(1<<h))) ret=1;
else ret=0;
}
else
{
h--;
if((q&(1<<h))) ret=0;
else ret=1;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |