QOJ.ac

QOJ

ID提交记录ID题目HackerOwner结果提交时间测评时间
#1063#672003#21686. 【NOIP Round #2】恰钱d909RCAd909RCAFailed.2024-10-24 15:19:332024-10-24 15:19:34

詳細信息

Extra Test:

Accepted
time: 122ms
memory: 14612kb

input:

100000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 1000000000
1 10000...

output:

2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

result:

ok Accepted!
ID题目提交者结果用时内存语言文件大小提交时间测评时间
#672003#21686. 【NOIP Round #2】恰钱d909RCA100 ✓183ms14912kbC++14679b2024-10-24 15:17:582024-10-24 15:17:58

answer

#include <bits/stdc++.h>
using namespace std; 
#define int long long
int T,n,a[100000009];
queue<pair<int,int> > q;
map<int,bool> v;
signed main()
{
//	freopen("qiaqia.in","r",stdin);
//	freopen("qiaqia.out","w",stdout);
	q.push({2,1});
	while(!q.empty())
	{
		pair<int,int> x=q.front();
		q.pop();
		if(x.first>1e9) continue ;
		a[++a[0]]=x.first;
		for(int i=x.second+1;i<=30;i++)
		{
			q.push({(x.first+(int)pow(2,i))<<1,i+1}); 
		}
	}
	sort(a+1,a+a[0]+1);
//	cout<<a[0]<<'\n';
	cin>>T;
	while(T--)
	{
		int l,r;
		cin>>l>>r;
		int x=lower_bound(a+1,a+a[0]+1,l)-a;
		if(r>=a[x]&&a[x]) cout<<a[x]<<'\n';
		else cout<<-1<<'\n';
	}
	return 0;
}
源文件, 语言: C++14
English 繁體中文 简体中文

伺服器時間: 2024-12-01 19:36:02 | 開源專案