제출 #1123505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123505		LucaIlie	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	379 ms	4504 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e5;
int v[MAX_N + 2];
long long frecvPart[MAX_N + 1];

int main() {
    int n;

    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        int x;
        cin >> x;
        int r = 1;
        while ( x % 2 == 0 ) {
            x /= 2;
            r *= 2;
        }

        frecvPart[i] = frecvPart[i - 1] + r;
        v[i] = x;
    }

    int q;

    cin >> q;
    for ( int i = 0; i < q; i++ ) {
        long long a;

        cin >> a;

        int l = 0, r = n + 1;
        while ( r - l > 1 ) {
            int mid = (l + r) / 2;

            if ( frecvPart[mid] < a )
                l = mid;
            else
                r = mid;
        }

        cout << v[r] << "\n";
    }
}

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