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;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define tup tuple<int, int, int>
#define pii pair<int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
int n, arr[200004], q;
signed main() {
ioss;
cin >> n;
vector<int> range(n+2);
for(int i = 1; i <= n; i++) {
cin >> arr[i];
int cnt = 1;
while(arr[i]%2 == 0) arr[i] /= 2, cnt *= 2;
range[i] = range[i-1]+cnt;
}
cin >> q;
int idx = 1;
for(int i = 1; i <= q; i++) {
int x; cin >> x;
while(range[idx] < x) idx++;
cout << arr[idx] << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |