Submission #1173173

#TimeUsernameProblemLanguageResultExecution timeMemory
1173173chikien2009Intercastellar (JOI22_ho_t1)C++20
100 / 100
42 ms4676 KiB
#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, q, a[200000];
long long x, b[200000];

int main()
{
    setup();

    cin >> n;
    for (int i = 0; i < n; ++i)
    {
        cin >> a[i];
        b[i] = 1;
        while (!(a[i] & 1))
        {
            b[i] <<= 1;
            a[i] >>= 1;
        }
        b[i] += (i == 0 ? 0 : b[i - 1]);
    }
    cin >> q;
    while (q--)
    {
        cin >> x;
        cout << a[lower_bound(b, b + n, x) - b] << "\n";
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...