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;
int main () {
int n; cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
set<pair<long long, long long>> s;
long long pos = 0;
for (auto elem: a) {
int count = 1;
while (elem % 2 == 0) {
count *= 2;
elem /= 2;
}
s.insert({pos, elem});
pos += count;
}
int q; cin >> q;
for (int i = 0; i < q; i++) {
long long query; cin >> query;
query--;
auto it = (s.upper_bound({query, 1e18}));
it--;
cout << (*it).second << '\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... |