This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
int a[n];
vector<pair<int, int>> v;
for(int i = 0; i < n; i++) {
cin >> a[i];
int x = a[i], k = 1;
while(x % 2 == 0) {
x /= 2;
k *= 2;
}
v.push_back({x, k});
}
ll sm[n];
for(int i = 0; i < n; i++)
sm[i] = v[i].second + (i ? sm[i - 1] : 0);
int q;
cin >> q;
while(q--) {
ll x;
cin >> x;
int lb = -1, rb = n;
while(rb - lb > 1) {
int mid = (lb + rb) / 2;
if(sm[mid] < x) lb = mid;
else rb = mid;
}
if(rb == n) cout << -1;
else cout << v[rb].first;
cout << '\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |