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;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
cin>>n;
ll a[n];
for (int i=0;i<n;i++) cin>>a[i];
ll num[n],pre[n];
for (int i=0;i<n;i++){
num[i] = 1;
while (a[i] % 2 == 0){
a[i] /= 2LL;
num[i] *= 2LL;
}
if (i) pre[i] = num[i] + pre[i-1];
else pre[i] = num[i];
}
int q;
cin>>q;
while (q--){
ll xi;
cin>>xi;
int l = 0, r = n-1;
while (l != r){
int m = (l+r)/2;
if (xi <= pre[m]) r = m;
else l = m + 1;
}
cout<<a[l]<<'\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... |