제출 #1164273

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

#define int long long

signed main(){
    int n;
    cin >> n;
    int arr[n];
    int pref[n];
    for (int i = 0; i<n; i++){
        cin >> arr[i];
        int num = 1;
        while (arr[i] % 2 == 0){
            arr[i] /= 2;
            num *= 2;
        }
        pref[i] = num;
    }
    for (int i = 1; i<n; i++){
        pref[i] += pref[i-1];
    }
    int q;
    cin >> q;
    while (q--){
        int x;
        cin >> x;
        auto it = lower_bound(pref,pref+n,x) - pref;
        cout << arr[it] << " ";
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...