제출 #795709

#제출 시각아이디문제언어결과실행 시간메모리
7957091binIntercastellar (JOI22_ho_t1)C++14
100 / 100
57 ms9208 KiB
#include <bits/stdc++.h>

using namespace std;

#define all(v) v.begin(), v.end()
typedef long long ll;
const int NMAX = 2e5 + 5;
ll n, a[NMAX], q, x, cnt[NMAX], i, b;

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n;
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < n; i++){
        cnt[i] = 1;
        while(a[i] % 2 == 0) a[i] /= 2, cnt[i] <<= 1;
    }
    
    cin >> q;
    while(q--){
        cin >> x; x--;
        ll t = x - b;
        while(t){
            if(cnt[i] <= t) t -= cnt[i++];
            else {
                cnt[i] -= t;
                break;
            }
        }
        cout << a[i] << '\n';
        b = x;
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...