#include "cmp.h"
void remember(int n) {
n += 4096;
while(n > 1) {
bit_set(n);
n >>= 1;
}
}
int compare(int b) {
b += 4096;
int low = 0, high = 12;
int btop = -1;
while(low <= high) {
int mid = (low+high) >> 1;
if((b>>mid) != 1 && !bit_get(b >> mid)) {
btop = b >> mid;
low = mid + 1;
}else {
high = mid - 1;
}
}
if(btop == -1) return 0;
/*
lca
/ \
a !
lca
/ \
/\ /\
b a
*/
int atop = (btop / 2) * 2;
if(btop / 2 * 2 == btop) ++atop;
return atop < btop ? 1 : -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2109 ms |
104984 KB |
Output is partially correct - maxAccess = 16, score = 46 |