oj.uz

Submission #95926

# Submission time Handle Problem Language Result Execution time Memory
95926 2019-02-04T12:14:21 Z Bodo171 Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 881 ms 104928 KB 
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))]+9*((lsb((x^y))&x)!=0);
}


#include <iostream>


int decode (int n, int q, int h) {
    int ret=0;
    if(h>9)
    {
        h-=10;
        if((q&(1<<h))) ret=1;
        else ret=0;
    }
    else
    {
        h--;
        if((q&(1<<h))) ret=0;
        else ret=1;
    }
    return ret;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 878 ms 104928 KB wrong answer
2 Incorrect 881 ms 104432 KB wrong answer