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;
using pii = pair<int, int>;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector<ll> a(n + 5);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int q;
cin >> q;
vector<pair<ll, int>> que(q + 5);
vector<ll> ans(q + 5);
for (int i = 1; i <= q; i++) {
cin >> que[i].first;
que[i].second = i;
}
sort(que.begin() + 1, que.begin() + q + 1);
// for (int i = 1; i <= q; i++) {
// cout << que[i].first << " " << que[i].second << "$$" << endl;
// }
int pnt1 = 1;
ll cnt = 0;
for (int i = 1; i <= n; i++) {
ll cnt2 = 1;
while (a[i] % 2 == 0) {
a[i] /= 2;
cnt2 *= 2;
// cout << "@" << a[i] << endl;
}
// cout << cnt << " " << cnt2 << " " << que[pnt1].first << endl;
while (pnt1 <= q && que[pnt1].first >= cnt + 1 && que[pnt1].first <= cnt + cnt2) {
ans[que[pnt1].second] = a[i];
++pnt1;
// cout << "##" << pnt1 << endl;
}
cnt += cnt2;
}
for (int i = 1; i <= q; i++) {
cout << ans[i] << "\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... |