题目大意就是给个在【1,10^9】子区间找到一个满足条件(count(尾随0)=count(1))的数
可知在最大区间内满足条件的数至多有5e5个因此可采用爆搜+二分即可
双层循环最外层控制枚举位数内层控制尾随0个数
代码如下:
/*
2022ICPC网络预选赛D Find The Number
爆搜+二分
*/
#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
vector<int>answer;//将符合条件的值存入
unordered_map<int, int>mp;//去重
int tot;
void DFS(int now, int step, int need) {//现尾随0个数,此时的位数,此时1的个数
if (now == need) {//尾随0的个数等于1的总数
if (!mp[tot])answer.push_back(tot);
++mp[tot];
return;
}
if (step == now)return;
for (int i = 1; i >= 0; i--) {
if (i)
{
need++; tot += 1 << step;
}
step--;
DFS(now, step, need);
step++;
if (i) {
need--; tot -= 1 << step;//回溯
}
}
return;
}
void solve() {
for (int i = 30; i >= 2; i--) {//枚举位数
for (int j = 1; j <= i / 2; j++) {//尾随0个数
tot = 1 << j;
DFS(j, i - 1, 1);
}
}
return;
}
int midFind(int x) {
//二分查找大于等于x的第一个数的下标
int right = answer.size();
int last = 0;
int mid = (last + right) >> 1;
while (right > last) {
if (answer[mid]>x) {
right = mid;
}
else if (answer[mid] < x) {
last = mid + 1;
}
else if(answer[mid]==x){
return mid;
}
mid = (last + right) >> 1;
}
return right;
}
int main() {
solve();
sort(answer.begin(), answer.end());
int t;
cin >> t;
while (t--) {
int l, r;
cin >> l >> r;
int ans = answer[midFind(l)];
if (ans <= r) {
cout << ans << "\n";
}
else {
cout << -1 << "\n";
}
}
return 0;
}
//起初读完题的想法是枚举1-10^9每个数先转二进制统计1和尾随0的个数判断是否相等进行一次预处理可惜超时
用DFS回溯搜索