This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#define y2 y_2
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
mt19937 rnd(time(NULL));
const ll mod=998244353;
const int N=610;
const int Lg=16;
void solve(){
int n;cin>>n;
vector<pair<ll,ll> >v;
for (int i=1;i<=n;i++){
ll x;cin>>x;
ll y=1;
while (x%2==0){
y*=2;
x/=2;
}
v.push_back({y,x});
}
int q;cin>>q;
int j=0;
ll sum=0ll;
for (int i=1;i<=q;i++){
ll x;cin>>x;
while (sum<x){
sum+=v[j++].first;
}
cout<<v[j-1].second<<endl;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int tt=1;
// cin>>tt;
while (tt--){
solve();
}
return 0;
}
/**
3
5 2 7 3 1 6 8 4
**/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |