제출 #532384

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532384		Marceantasy	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	451 ms	9204 KiB

Main

#include <bits/stdc++.h>
using namespace std; 

#define ll long long 
#define ar array

const int mxN = 2e5+5, M = 1e9+7;
int n, q; 
pair<ll, ll> a[mxN];

int main(){
    cin >> n; 
    for(int i = 0; i<n; ++i){
        ll num; 
        cin >> num;  
        ll cnt = 1; 
        while(num % 2 == 0){
            num /= 2; 
            cnt *= 2;
        }
        a[i] = make_pair(num, cnt);
    }
    cin >> q;
    ll flag = 0;
    int idx = 0; 
    while(q--){
        ll x;
        cin >> x;
        while(idx < n && flag + a[idx].second < x){
            flag += a[idx++].second;
        }
        cout << a[idx].first << "\n";
    }
}

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