제출 #863800

#제출 시각아이디문제언어결과실행 시간메모리
863800prairie2022Intercastellar (JOI22_ho_t1)C++17
100 / 100
52 ms8552 KiB
#include<bits/stdc++.h>
typedef long long ll;
#define fastio cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
using namespace std;

int main(){
    fastio
    int n, q, pt = 0;
    ll x;
    cin >> n;
    vector<int> a(n+1);
    vector<ll> pre(n+1, 0);
    for(int i=1; i<=n; i++){
        cin >> a[i];
        pre[i] = a[i]&-a[i];
        a[i] >>= __lg(pre[i]);
        pre[i] += pre[i-1];
    }
    for(cin >> q; q; q--){
        cin >> x;
        while(x>pre[pt]) pt++;
        cout << a[pt] << '\n';
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...