Submission #656934

#TimeUsernameProblemLanguageResultExecution timeMemory
656934Darren0724Intercastellar (JOI22_ho_t1)C++17
100 / 100
80 ms10748 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(),x.end()


void solve(){
    int n;cin>>n;
    vector<int> a(n),b(n);
    for(int i=0;i<n;i++){
        int k;cin>>k;
        int p=1;
        while(k%2==0){
            k/=2;
            p*=2;
        }
        a[i]=k;
        b[i]=p;
    }
    vector<int> v(n+1);
    for(int i=1;i<=n;i++){
        v[i]=v[i-1]+b[i-1];
    }
    int q;cin>>q;
    for(int i=0;i<q;i++){
        int k;cin>>k;
        int r=lower_bound(all(v),k)-v.begin();
        cout<<a[r-1]<<'\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int t=1;
    while(t--){
        solve();
    }


    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...