제출 #1151451

#제출 시각아이디문제언어결과실행 시간메모리
1151451ezzzayIntercastellar (JOI22_ho_t1)C++20
100 / 100
282 ms5532 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
int a[N];
signed main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	int l=0;
	vector<int>idx;
	for(int i=1;i<=n;i++){
		int p=1;
		while(a[i]%2==0){
			a[i]/=2;
			p*=2;
		}
		idx.pb(l+1);
		l+=p;
	}
	int q;
	cin>>q;
	while(q--){
		int x;
		cin>>x;
		auto it=upper_bound(idx.begin(),idx.end(),x);
		int h= it-idx.begin();
		cout<<a[h]<<endl;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...