# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
928218 | pcc | Intercastellar (JOI22_ho_t1) | C++17 | 64 ms | 9920 KiB |
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 ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
ll N,Q;
vector<pll> v;
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>N;
for(int i = 0;i<N;i++){
ll k;
cin>>k;
ll c = 1;
while(k%2 == 0)k>>=1,c<<=1;
v.push_back({c,k});
}
for(int i = 1;i<v.size();i++)v[i].fs += v[i-1].fs;
cin>>Q;
while(Q--){
ll pos;
cin>>pos;
pll tmp = make_pair(pos,-1);
cout<<(lower_bound(v.begin(),v.end(),tmp)->sc)<<'\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |