제출 #676161

#제출 시각아이디문제언어결과실행 시간메모리
676161rittin1Intercastellar (JOI22_ho_t1)C++17
100 / 100
83 ms12576 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    int a[n+1];
    for(int i=1;i<=n;i++){
        cin >> a[i];
    }
    deque<pair<int,int>> d;
    for(int i=n;i>=1;i--){
        if(a[i]%2!=0){
            d.push_front({1,a[i]});
        }
        else{
            int steps=0;
            while(a[i]%2==0){
                a[i]=a[i]/2;
                steps++;
            }
            steps=(1ll<<steps);
            d.push_front({steps,a[i]});
        }
    }
    //cout << '\n';
    vector<int> v;
    for(int i=0;i<n;i++){
        if(i==0){
            v.push_back(d[i].first);
        }
        else{
            v.push_back(v[i-1]+d[i].first);
        }
        
    }
    int q;
    cin >> q;
    while(q--){
        int x;
        cin >> x;
        int ind=lower_bound(v.begin(),v.end(),x)-v.begin();
        cout << d[ind].second << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...