제출 #803634

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
803634		luci	Intercastellar (JOI22_ho_t1)	C++17	25 / 100	244 ms	3828 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define tup tuple<int, int, int>
#define pii pair<int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
int n, arr[200004], q;
signed main() {
    ioss;
    cin >> n;
    vector<int> range(n+2);
    for(int i = 1; i <= n; i++) {
        cin >> arr[i];
        int cnt = 0;
        for(int j = 0; j < 30; j++) {
            if(arr[i]%(1ll << j) == 0) cnt = (1ll << j);
            else {
                arr[i] = arr[i]/(1ll << (j-1));
                break;
            }
        }
        range[i] = range[i-1]+cnt;
    }
    cin >> q;
    int idx = 1;
    for(int i = 1; i <= q; i++) {
        int x; cin >> x;
        while(range[idx] < x) idx++;
        cout << arr[idx] << endl;
    }
}

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