제출 #998728

#제출 시각아이디문제언어결과실행 시간메모리
998728Angus_YeungIntercastellar (JOI22_ho_t1)C++17
100 / 100
49 ms9188 KiB
#include <bits/stdc++.h>
#define x first
#define y second
#define pii pair<ll, ll>
typedef long long ll;
const ll MOD = 1000000007LL;
const ll INF = 1e15;
using namespace std;

ll n, q, a[200010], x, sum[200010];
ll l, r, mid;

int main() {
	cin.tie(0); cout.tie(0);
	ios::sync_with_stdio(0);
	
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		sum[i] = a[i]&(-a[i]);
		a[i] /= a[i]&(-a[i]);
		sum[i] += sum[i-1];
	}
	
	cin >> q;
	while (q--) {
		cin >> x;
		l = 1, r = n;
		while (l < r) {
			mid = (l+r)/2;
			if (sum[mid] < x) l = mid+1;
			else r = mid;
		}
		cout << a[r] << "\n";
	}
	
	return 0;
}
/*



*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...