oj.uz

Submission #1085905

# Submission time Handle Problem Language Result Execution time Memory
1085905 2024-09-09T03:27:06 Z RiverFlow Intercastellar (JOI22_ho_t1) C++14
100 / 100
 57 ms 11720 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int n, q, a[N];
long long s[N];

void main_code() {
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    vector<pair<int, long long>> res;
    FOD(i, n, 1) {
        int val = a[i];
        long long cnt = 1;
        while (val % 2 == 0) {
            cnt *= 2LL, val /= 2;
        }
        res.push_back(_mp(val, cnt));
    }
    const long long LIM = (long long)1e16;
    reverse(all(res));
    for(int i = 0; i < n; ++i) {
        s[i] = s[i - 1] + res[i].second;
        if (s[i] > LIM) s[i] = LIM;
    }
    cin >> q;

    while (q--) {
        long long x; cin >> x;
        int j = lower_bound(s, s + n, x) - s;
        cout << res[j].first << nl;
    }
}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 25.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 17 ms 6548 KB Output is correct
4 Correct 19 ms 3076 KB Output is correct
5 Correct 38 ms 8128 KB Output is correct
6 Correct 21 ms 6352 KB Output is correct
7 Correct 40 ms 8124 KB Output is correct
8 Correct 46 ms 8132 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
40.0 / 40.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 17 ms 6548 KB Output is correct
4 Correct 19 ms 3076 KB Output is correct
5 Correct 38 ms 8128 KB Output is correct
6 Correct 21 ms 6352 KB Output is correct
7 Correct 40 ms 8124 KB Output is correct
8 Correct 46 ms 8132 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 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 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 448 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 20 ms 3736 KB Output is correct
24 Correct 26 ms 7112 KB Output is correct
25 Correct 50 ms 11208 KB Output is correct
26 Correct 35 ms 7380 KB Output is correct
27 Correct 30 ms 7420 KB Output is correct
28 Correct 57 ms 11720 KB Output is correct
29 Correct 53 ms 11196 KB Output is correct
30 Correct 26 ms 4308 KB Output is correct
31 Correct 56 ms 11708 KB Output is correct