oj.uz

Submission #862223

# Submission time Handle Problem Language Result Execution time Memory
862223 2023-10-17T18:47:04 Z arbuzick Intercastellar (JOI22_ho_t1) C++17
25 / 100
 44 ms 6484 KB 
#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<pair<int, int>> b(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        int pw = 0;
        while (a[i] % (1 << (pw + 1)) == 0) {
            pw++;
        }
        b[i] = {1 << pw, a[i] / (1 << pw)};
    }
    vector<long long> pr_cnt(n + 1);
    for (int i = 0; i < n; ++i) {
        pr_cnt[i + 1] = pr_cnt[i] + b[i].first;
    }
    int q;
    cin >> q;
    while (q--) {
        int x;
        cin >> x;
        x--;
        int pos = upper_bound(pr_cnt.begin(), pr_cnt.end(), x) - pr_cnt.begin() - 1;
        cout << b[pos].second << '\n';
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 17 ms 4700 KB Output is correct
4 Correct 23 ms 2652 KB Output is correct
5 Correct 40 ms 6224 KB Output is correct
6 Correct 25 ms 4688 KB Output is correct
7 Correct 44 ms 6484 KB Output is correct
8 Correct 40 ms 6484 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 472 KB Output is correct
9 Incorrect 0 ms 456 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 17 ms 4700 KB Output is correct
4 Correct 23 ms 2652 KB Output is correct
5 Correct 40 ms 6224 KB Output is correct
6 Correct 25 ms 4688 KB Output is correct
7 Correct 44 ms 6484 KB Output is correct
8 Correct 40 ms 6484 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 472 KB Output is correct
17 Incorrect 0 ms 456 KB Output isn't correct
18 Halted 0 ms 0 KB -