int b[950];
void cal(){
b[0] = 1;
int num = 1;
for(int i = 0; i < 950; i++){
if(__builtin_popcount(i) == 6) b[num++] = i;
}
}
int encode (int n, int x, int y) {
if(b[0] == 1) cal();
for(int i = 0; i < 12; i++){
if((b[x] & (1 << i)) && !(b[y] & (1 << i))){
return i;
}
}
return 1;
}
int b[950];
void cal(){
b[0] = 1;
int cnt = 1;
for(int i = 0; i < 950; i++){
if(__builtin_popcount(i) == 6) b[cnt++] = i;
}
}
int decode (int n, int q, int h) {
if(b[0] == 0) cal();
if(b[q] & (1 << h)) return 1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1841 ms |
24048 KB |
wrong answer |
2 |
Incorrect |
1845 ms |
24112 KB |
wrong answer |