제출 #536734

#제출 시각아이디문제언어결과실행 시간메모리
536734neon_paradoxIntercastellar (JOI22_ho_t1)C++14
100 / 100
491 ms6828 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t	 main(){
	int n;
	cin >> n;
	int a[n];
	int d[n];
	int s[n];
	for (int i = 0; i < n; i++){
		cin >> a[i];
		int count = 1;
		while(a[i]%2==0){
			a[i]/=2;
			count*=2;
		}
		d[i] = count;
	}
	s[0]=d[0];
	for (int i = 1; i < n; i++){
		s[i]=s[i-1]+d[i];
		//cout << "sum " << i << ": " << s[i] << "\n";
	}
	int q;
	cin >> q;
	int v;
	for (int i = 0; i < q; i++){
		cin >> v;
		/*auto it = lower_bound(s,s+n,v);
		if(*it==v){
			cout << a[it-s];
			continue;
		}*/
		
		int k = lower_bound(s,s+n,v)-s;
		cout << a[k] << "\n";
	}
	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...