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() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int q;
cin >> q;
vector<long long> b(q);
for (int i = 0; i < q; i++) {
cin >> b[i];
}
vector<int> num(n);
vector<int> ct(n);
for (int i = 0; i < n; i++) {
int c = 1;
int x = a[i];
while (x % 2 == 0) {
c *= 2;
x /= 2;
}
num[i] = x;
ct[i] = c;
}
int p = 0;
long long sum = 0;
for (int i = 0; i < q; i++) {
while (sum + ct[p] < b[i]) {
sum += ct[p];
p++;
}
cout << num[p] << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |