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>
#define ll long long
using namespace std;
int main()
{
int N; cin >> N;
vector<pair<int,int>> ans;
for(int i = 0;i<N;++i){
int x; cin >> x;
int y = 1;
while(x % 2 == 0){
x /= 2; y *= 2;
}
ans.push_back({y,x});
//cout << y << " " << x << "\n";
}
//cout << ans[0].first << "\n";
int Q; cin >> Q;
int i = 0; ll cur = 0;
while(Q--){
ll x; cin >> x;
while(i < N && cur+ans[i].first < x){
cur += ans[i].first;
i++;
}
//cout << i-1 << " " << cur << "\n";
cout << ans[i].second << "\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... |