oj.uz

Submission #838415

# Submission time Handle Problem Language Result Execution time Memory
838415 2023-08-26T20:04:53 Z makrav Intercastellar (JOI22_ho_t1) C++14
25 / 100
 50 ms 5740 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vei;
typedef vector<vei> vevei;

#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define con cout << "NO\n"
#define coe cout << "YES\n";
#define str string
#define pb push_back
#define ff first
#define sc second
#define pii pair<int, int>
#define mxe max_element
#define mne min_element
#define stf shrink_to_fit
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    f(i, 0, n) cin >> a[i];
    vector<int> cnt(n, 0), val(n);
    f(i, 0, n) {
        int c = 1, v = a[i];
        while (v % 2 == 0) {
            c *= 2;
            v /= 2;
        }
        cnt[i] = c; val[i] = v;
    }
    vector<int> pref(n + 1, 0);
    f(i, 1, n + 1) pref[i] = pref[i - 1] + cnt[i - 1];
    int q; cin >> q;
    while (q--) {
        int x; cin >> x;
        int L = 0, R = n;
        while (R - L > 1) {
            int M = (L + R) / 2;
            if (pref[M] >= x) R = M;
            else L = M;
        }
        cout << val[L] << '\n';
    }

    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 18 ms 3924 KB Output is correct
4 Correct 36 ms 2292 KB Output is correct
5 Correct 47 ms 5452 KB Output is correct
6 Correct 27 ms 4164 KB Output is correct
7 Correct 47 ms 5580 KB Output is correct
8 Correct 50 ms 5740 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 212 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 212 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 18 ms 3924 KB Output is correct
4 Correct 36 ms 2292 KB Output is correct
5 Correct 47 ms 5452 KB Output is correct
6 Correct 27 ms 4164 KB Output is correct
7 Correct 47 ms 5580 KB Output is correct
8 Correct 50 ms 5740 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -