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
#define pii pair<int,int>
#define vi vector<int>
#define si set<int>
#define pb push_back
int low(vector<int> v,int k) {
vector<int>::iterator t=lower_bound(v.begin(),v.end(),k);
int ind=t-v.begin();
return ind;
}
void solve() {
int n; cin>>n;
int a[n];
vector<pii> nums(n);
vi sums(n);
int sum=0;
for (int i=0;i<n;i++) {
cin>>a[i];
int m=1;
while(a[i]%2==0) {
m*=2;
a[i]/=2;
}
pair<int,int> p; p.first=a[i]; p.second=m;
nums[i]=p;
sum+=m;
sums[i]=sum;
}
int q; cin>>q;
while(q--) {
int x; cin>>x;
int i=low(sums,x);
cout<<nums[i].first<<endl;
}
return;
}
int32_t main() {
ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int tt=1; //cin>>tt;
while(tt--) {
solve();
}
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... |