제출 #526417

#제출 시각아이디문제언어결과실행 시간메모리
526417benson1029Intercastellar (JOI22_ho_t1)C++14
100 / 100
329 ms4532 KiB
#include<bits/stdc++.h>
using namespace std;

int n;
int a[200005]; long long psum[200005];
int q; long long x;

int main() {
	ios::sync_with_stdio(false);
	cin >> n;
	for(int i=1; i<=n; i++) cin >> a[i];
	for(int i=1; i<=n; i++) {
		psum[i] = psum[i-1];
		int tmp = a[i];
		while(a[i]%2==0) {
			a[i]/=2;
		}
		psum[i] += tmp/a[i];
	}
	cin >> q;
	while(q--) {
		cin >> x;
		int tmp = lower_bound(psum+1, psum+n+1, x)-psum;
		cout << a[tmp] << "\n"; 
	} 
} 
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...