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;
typedef long long ll;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n, q;
cin >> n;
vector<pair<ll,ll>> pedacos;
for(int i=0; i<n; i++){
int tam;
cin >> tam;
int cnt=1;
while(!(tam&(1))){
tam>>=1;
cnt<<=1;
}
pedacos.push_back({cnt, tam});
}
cin >> q;
ll ptr=-1, qtd=0;
while(q--){
ll pos;
cin >> pos;
while(pos>qtd){
ptr++;
qtd+=pedacos[ptr].first;
}
cout << pedacos[ptr].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... |