제출 #1198783

#제출 시각아이디문제언어결과실행 시간메모리
1198783Hamed_GhaffariIntercastellar (JOI22_ho_t1)C++20
100 / 100
39 ms4748 KiB
#include<bits/stdc++.h>
using namespace std;

using ll = long long;

const int MXN = 2e5+5;

int n, a[MXN];
ll ps[MXN];

int32_t main() {
    cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<=n; i++) {
        cin >> a[i];
        ps[i] = 1;
        while(a[i]%2==0) {
            a[i] /= 2;
            ps[i] *= 2;
        }
        ps[i] += ps[i-1];
    }
    int ptr=1;
    int q;
    cin >> q;
    while(q--) {
        ll x;
        cin >> x;
        while(ps[ptr]<x) ptr++;
        cout << a[ptr] << '\n';
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...