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;
void solve() {
int n;
cin >> n;
vector<long long> pref(n + 1);
vector<int> l(n);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
l[i] = x / (x & -x);
pref[i + 1] = pref[i] + (x & -x);
}
int q;
cin >> q;
while (q--) {
long long x;
cin >> x;
cout << l[lower_bound(pref.begin(), pref.end(), x) - pref.begin() - 1] << "\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |