oj.uz

Submission #168720

# Submission time Handle Problem Language Result Execution time Memory
168720 2019-12-15T13:50:21 Z mhy908 Question (Grader is different from the original contest) (CEOI14_question_grader) C++14
100 / 100
 1489 ms 79512 KB 
int c[930],r,f,i=1;
int encode(int N, int x, int y){
    if(!f)for(;i<=4096;i++)if(__builtin_popcount(i)==6)c[++r]=i;f=1;
    return __builtin_ffs(c[x]&(c[x]^c[y]));
}
int c[930],r,f,i=1;
int decode(int N, int q, int h){
    if(!f)for(;i<=4096;i++)if(__builtin_popcount(i)==6)c[++r]=i;f=1;
    return c[q]&(1<<(h-1))?1:0;
}

Compilation message

encoder.cpp: In function 'int encode(int, int, int)':
encoder.cpp:3:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(!f)for(;i<=4096;i++)if(__builtin_popcount(i)==6)c[++r]=i;f=1;
     ^~
encoder.cpp:3:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     if(!f)for(;i<=4096;i++)if(__builtin_popcount(i)==6)c[++r]=i;f=1;
                                                                 ^

decoder.cpp: In function 'int decode(int, int, int)':
decoder.cpp:3:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(!f)for(;i<=4096;i++)if(__builtin_popcount(i)==6)c[++r]=i;f=1;
     ^~
decoder.cpp:3:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     if(!f)for(;i<=4096;i++)if(__builtin_popcount(i)==6)c[++r]=i;f=1;
                                                                 ^

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1487 ms 79280 KB Output is correct - maxh = 12
2 Correct 1489 ms 79512 KB Output is correct - maxh = 12