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<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pl;
const ll mxn=200002;
ll n;
ll a[mxn];
ll val[mxn];
ll c[mxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
for(ll i=1;i<=n;i++)
cin>>a[i];
for(ll i=1;i<=n;i++)
{
ll k=a[i];
while(a[i]%2==0)
a[i]/=2;
val[i]=a[i];
c[i]=k/a[i];
c[i]+=c[i-1];
}
ll q;
cin>>q;
while(q--)
{
ll x;
cin>>x;
ll h=lower_bound(c+1,c+n+1,x)-c;
cout<<val[h]<<'\n';
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |