#include "cmp.h"
#include <vector>
#include <algorithm>
using namespace std;
void remember(int n) {
n += 4096;
while(n){
bit_set(n);
n >>= 1;
}
}
int compare(int b) {
b += 4096;
if(bit_get(b)) return 0;
vector<int> v;
while(b){
v.push_back(b);
b >>= 1;
}
reverse(v.begin(), v.end());
int s = 0, e = v.size() - 2;
while(s != e){
int m = (s+e)/2;
if(!bit_get(v[m])) e = m;
else s = m+1;
}
if(v[s]%2) return 1;
return -1;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
919 ms |
104952 KB |
ZERO POINTS: For a=2215 and b=2214, correct answer is -1, got 1 |
