oj.uz

Submission #995577

# Submission time Handle Problem Language Result Execution time Memory
995577 2024-06-09T11:52:05 Z vyshniak_n Intercastellar (JOI22_ho_t1) C++17
100 / 100
 68 ms 10908 KB 
//#pragma optimize("Ofast")
//#pragma optimize("unroll-loops")
//#pragma traget("avx,avx2")

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

#define el '\n'
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define point pair <ll, ll>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

#include <random>
mt19937 rnd(time(0));

const ll INF = 1e18 + 10;
const ll inf = 1e9 + 10;
const ll N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll LOG = 20;
const ll K = 1e3 + 20;

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

    vector <ll> a(n);
    vector <point> b(n);
    for (ll i = 0; i < n; i++) {
        cin >> a[i];

        ll cnt = 1;
        while (a[i] % 2 == 0) {
            cnt *= 2;
            a[i] /= 2;
        }

        b[i] = {a[i], cnt + (i != 0 ? b[i - 1].ss : 0)};
    }

    ll q;
    cin >> q;

    while (q--) {
        ll x;
        cin >> x;

        ll l = -1, r = n;
        while (l + 1 < r) {
            ll mid = (l + r) >> 1;

            if (b[mid].ss < x) l = mid;
            else r = mid;
        }

        cout << b[r].ff << el;
    }
    return;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int tests = 1;
    //cin >> tests;

    while (tests--) 
        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 15 ms 5480 KB Output is correct
4 Correct 20 ms 2652 KB Output is correct
5 Correct 36 ms 7248 KB Output is correct
6 Correct 21 ms 5492 KB Output is correct
7 Correct 34 ms 7092 KB Output is correct
8 Correct 34 ms 7264 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 460 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 0 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 372 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #3
40.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 15 ms 5480 KB Output is correct
4 Correct 20 ms 2652 KB Output is correct
5 Correct 36 ms 7248 KB Output is correct
6 Correct 21 ms 5492 KB Output is correct
7 Correct 34 ms 7092 KB Output is correct
8 Correct 34 ms 7264 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 460 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 0 ms 348 KB Output is correct
17 Correct 1 ms 456 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 372 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 18 ms 3396 KB Output is correct
24 Correct 23 ms 6480 KB Output is correct
25 Correct 50 ms 10320 KB Output is correct
26 Correct 32 ms 6736 KB Output is correct
27 Correct 31 ms 6736 KB Output is correct
28 Correct 52 ms 10908 KB Output is correct
29 Correct 50 ms 10320 KB Output is correct
30 Correct 29 ms 3928 KB Output is correct
31 Correct 68 ms 10836 KB Output is correct