제출 #715273

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
715273		alextodoran	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	84 ms	9172 KiB

Main

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 200000;
const int Q_MAX = 200000;

int N, Q;
ll A[N_MAX + 2];
ll pref[N_MAX + 2];

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N;
    for (int i = 1; i <= N; i++) {
        cin >> A[i];
        pref[i] = 1;
        while (A[i] % 2 == 0) {
            A[i] /= 2;
            pref[i] *= 2;
        }
        pref[i] += pref[i - 1];
    }
    cin >> Q;
    while (Q--) {
        ll X;
        cin >> X;
        int l = 1, r = N;
        while (l < r) {
            int mid = (l + r) / 2;
            if (X <= pref[mid]) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        cout << A[l] << "\n";
    }

    return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40