제출 #938550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
938550		the_coding_pooh	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	56 ms	7636 KiB

Main

#include <bits/stdc++.h>
#include <bits/extc++.h>
#define uwu return 0;

using namespace std;

#define fs first
#define sc second

using ll = long long;

const int SIZE = 2e5 + 5;

int N, Q;

ll arr[SIZE], x;

ll div(ll i){
    ll a = arr[i], ret = 1;
    
    while(!(a & 1)){
        a >>= 1;
        arr[i] >>= 1;
        ret <<= 1;
    }
    
    return ret;
}

int main(){
    cin.tie(0), ios::sync_with_stdio(0);
    cin >> N;
    
    for (int i = 1; i <= N;i++){
        cin >> arr[i];
    }

    cin >> Q;

    ll nttl = 0, i = 0;

    while(Q--){
        cin >> x;
        while(nttl < x){
            nttl += div(++i);
        }
        cout << arr[i] << '\n';
    }

    uwu
}

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