Submission #980848

#	Time	Username	Problem	Language	Result	Execution time	Memory
980848		LOLOLO	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	85 ms	9492 KiB

Main

#include <bits/stdc++.h>
#define ll long long
using namespace std;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 2e5 + 10;
ll a[N], p[N];

void solve() {
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        ll t = 1;
        while (a[i] % ((ll)2 * t) == 0) {
            t = (t + t);
        }

        a[i] /= t;
        p[i] = t;
        p[i] = p[i - 1] + t;
    }

    int q;
    cin >> q;
    int j = 1;
    for (int i = 0; i < q; i++) {
        ll x;
        cin >> x;
        while (p[j] < x) {
            j++;
        }

        cout << a[j] << "\n";
    }
}

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

    int t = 1;
    //cin >> t;

    while (t--) {
        solve();
    }

    return 0;
}  

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