Submission #941066

#	Time	Username	Problem	Language	Result	Execution time	Memory
941066		Pring	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	75 ms	10880 KiB

Main

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

#ifdef MIKU
const string dbmc = "\033[1;38;2;57;197;187m", dbrs = "\033[0m";
#define debug(x...) cout << dbmc << "[" << #x << "]: ", dout(x)
void dout() { cout << dbrs << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define dout(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 200005;
int n, q, a[MXN], x;
int cnt[MXN], p[MXN];

void miku() {
    cin >> n;
    FOR(i, 0, n) {
        cin >> a[i];
        cnt[i] = 1;
        while (a[i] % 2 == 0) {
            a[i] /= 2;
            cnt[i] *= 2;
        }
    }
    FOR(i, 0, n) p[i + 1] = p[i] + cnt[i];

    // FOR(i, 0, n + 1) cout << p[i] << ' ';
    // cout << endl;
    // FOR(i, 0, n + 1) cout << a[i] << ' ';
    // cout << endl;

    cin >> q;
    while (q--) {
        cin >> x;
        int id = lower_bound(p, p + n, x) - p;
        id--;
        cout << a[id] << '\n';
    }
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(cin.failbit);
    miku();
    return 0;
}

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