oj.uz

Submission #343884

# Submission time Handle Problem Language Result Execution time Memory
343884 2021-01-04T16:50:10 Z beksultan04 Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
0 / 100
 2999 ms 24680 KB 
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=0;i<12;++i){
        if (((x>>i)&1) && !((y>>i)&1) )return i+1;
    }
    
    return 0;
}
int pp[10001],cnt=0;

int decode (int n, int q, int h) {
    if (!cnt){
        for (int i=0;i<(1<<12);++i)
            if (__builtin_popcount(i) == 6)pp[cnt++]=i;
        
    }
    q = pp[q-1];
    return (q&(1<<(h-1)))&1;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 2999 ms 24680 KB wrong answer
2 Incorrect 2681 ms 24488 KB wrong answer