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 int long long
int inf=1e15;
int n;int Q;
int oar[200005];
int ar[200005];
int ps[200005];
signed main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>oar[i];
ps[i]=ps[i-1];
int v=oar[i];int cnt=0;
while(v%2==0){
cnt++;v/=2;
}
ar[i]=(1ll<<(cnt));
if(ps[i-1]>=1e15){continue;}
ps[i]=ar[i]+ps[i-1];
}
/*
for(int i=1;i<=n;i++){
cout<<ps[i]<<" ";
}cout<<endl;
*/
cin>>Q;
while(Q--){
int pl;
cin>>pl;
int l=1;int r=n;
while(l<r){
int mi=l+(r-l)/2;
if(ps[mi]>=pl){
r=mi;
}else{
l=mi+1;
}
}
int v=oar[l];
while(v%2==0){
v/=2;
}
cout<<v<<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... |