oj.uz

Submission #894278

# Submission time Handle Problem Language Result Execution time Memory
894278 2023-12-28T03:30:26 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 253896 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <cassert>
#include <algorithm>
using namespace std;
struct Node {
    int mx;
    int mn;
    int val;
    vector<int> v;
    Node (int mn, int mx) {
        this->mx = mx, this->mn = mn, this->val = 0;
    }
};
struct SegmentTree {
    vector<Node> vec;
    vector<int> nodes;
    Node merge (Node &left, Node &right) {
        Node ans = {min(left.mn, right.mn), max(left.mx, right.mx)};
        ans.val = max(left.val, right.val);
        if (right.mx < left.mx) {
            ans.val = max(ans.val, left.mx + right.mx);
        } else if (right.mn < left.mx) {
            int l = 0;
            int r = right.v.size() - 1;
            while (l != r) {
                int m = (l + r + 1)/2;
                if (right.v[m] < left.mx) {
                    l = m;
                } else {
                    r = m - 1;
                }
            }
            ans.val = max(ans.val, *(--lower_bound(right.v.begin(), right.v.end(), left.mx)) + left.mx);
        }
        return ans;
    }
    vector<int> intervals;
    void query (int dum, int tl, int tr, int l, int r) {
        if (tl >= l && tr <= r) {
            intervals.push_back(dum);
        } else if (tl <= r && tr >= l) {
            query(2 * dum + 1, tl, (tl + tr)/2,l, r), query(2 * dum + 2, (tl + tr)/2 + 1, tr, l, r);
        }
    }
    int query (int l, int r) {
        intervals.clear();
        query(0, 0, (int)vec.size()/2 - 1, l, r);
        Node ans = vec[intervals[0]];
        for (int i = 1; i < intervals.size(); i++) {
            ans = merge(ans, vec[intervals[i]]);
        }
        return ans.val;
    }
    void build (int dum, int tl, int tr) {
        if (tl == tr) {
            vec[dum] = Node(nodes[tl], nodes[tl]);
            vec[dum].v = {nodes[tl]};
        } else {
            build(2 * dum + 1, tl, (tl + tr)/2), build(2 * dum + 2, (tl + tr)/2 + 1, tr);
            vec[dum] = merge(vec[2 * dum + 1], vec[2 * dum + 2]);
            std::merge(vec[2 * dum + 1].v.begin(), vec[2 * dum + 1].v.end(),
                       vec[2 * dum + 2].v.begin(), vec[2 * dum + 2].v.end(),
                       std::back_inserter(vec[dum].v));
        }
    }
    SegmentTree (vector<int> nodes) {
        this->nodes = nodes;
        int n = nodes.size();
        n = (1 << (int)log2(n)) * 2;
        vec.assign(2 * n, Node(INT_MAX, -INT_MAX));
        this->nodes.reserve(vec.size());
        while (this->nodes.size() < vec.size()) {
            this->nodes.push_back((int)1e9);
        }
        build(0, 0, (int)vec.size()/2 - 1);
    }
};
int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, q;
    cin >> n >> q;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    SegmentTree st(v);
    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;
        l--, r--;
        cout << (st.query(l, r) <= k) << '\n';
    }
}

Compilation message

sortbooks.cpp: In member function 'int SegmentTree::query(int, int)':
sortbooks.cpp:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.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 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 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.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 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 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 696 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 7 ms 2088 KB Output is correct
15 Correct 6 ms 1884 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 5 ms 1884 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2428 ms 238024 KB Output is correct
2 Correct 2375 ms 238012 KB Output is correct
3 Correct 2456 ms 237904 KB Output is correct
4 Correct 2414 ms 238092 KB Output is correct
5 Correct 1570 ms 238016 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 28360 KB Output is correct
2 Correct 166 ms 28360 KB Output is correct
3 Correct 127 ms 28400 KB Output is correct
4 Correct 115 ms 28372 KB Output is correct
5 Correct 118 ms 28364 KB Output is correct
6 Correct 102 ms 28364 KB Output is correct
7 Correct 105 ms 28372 KB Output is correct
8 Correct 332 ms 28364 KB Output is correct
9 Correct 38 ms 616 KB Output is correct
10 Correct 336 ms 28364 KB Output is correct

Subtask #5
30.0 / 30.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 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 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 696 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 7 ms 2088 KB Output is correct
15 Correct 6 ms 1884 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 5 ms 1884 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct
19 Correct 366 ms 57412 KB Output is correct
20 Correct 428 ms 57212 KB Output is correct
21 Correct 314 ms 57408 KB Output is correct
22 Correct 309 ms 57408 KB Output is correct
23 Correct 328 ms 57264 KB Output is correct
24 Correct 230 ms 57408 KB Output is correct
25 Correct 230 ms 57240 KB Output is correct
26 Correct 247 ms 57412 KB Output is correct
27 Correct 268 ms 57396 KB Output is correct
28 Correct 259 ms 57352 KB Output is correct
29 Correct 265 ms 57408 KB Output is correct
30 Correct 267 ms 57412 KB Output is correct
31 Correct 280 ms 57232 KB Output is correct
32 Correct 277 ms 57412 KB Output is correct
33 Correct 276 ms 57408 KB Output is correct
34 Correct 225 ms 57408 KB Output is correct
35 Correct 221 ms 57396 KB Output is correct
36 Correct 223 ms 57420 KB Output is correct
37 Correct 224 ms 57408 KB Output is correct
38 Correct 222 ms 57408 KB Output is correct
39 Correct 976 ms 57180 KB Output is correct
40 Correct 1576 ms 56860 KB Output is correct
41 Correct 1215 ms 57252 KB Output is correct

Subtask #6
0 / 23.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 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 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 696 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 7 ms 2088 KB Output is correct
15 Correct 6 ms 1884 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 5 ms 1884 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct
19 Correct 2428 ms 238024 KB Output is correct
20 Correct 2375 ms 238012 KB Output is correct
21 Correct 2456 ms 237904 KB Output is correct
22 Correct 2414 ms 238092 KB Output is correct
23 Correct 1570 ms 238016 KB Output is correct
24 Correct 186 ms 28360 KB Output is correct
25 Correct 166 ms 28360 KB Output is correct
26 Correct 127 ms 28400 KB Output is correct
27 Correct 115 ms 28372 KB Output is correct
28 Correct 118 ms 28364 KB Output is correct
29 Correct 102 ms 28364 KB Output is correct
30 Correct 105 ms 28372 KB Output is correct
31 Correct 332 ms 28364 KB Output is correct
32 Correct 38 ms 616 KB Output is correct
33 Correct 336 ms 28364 KB Output is correct
34 Correct 366 ms 57412 KB Output is correct
35 Correct 428 ms 57212 KB Output is correct
36 Correct 314 ms 57408 KB Output is correct
37 Correct 309 ms 57408 KB Output is correct
38 Correct 328 ms 57264 KB Output is correct
39 Correct 230 ms 57408 KB Output is correct
40 Correct 230 ms 57240 KB Output is correct
41 Correct 247 ms 57412 KB Output is correct
42 Correct 268 ms 57396 KB Output is correct
43 Correct 259 ms 57352 KB Output is correct
44 Correct 265 ms 57408 KB Output is correct
45 Correct 267 ms 57412 KB Output is correct
46 Correct 280 ms 57232 KB Output is correct
47 Correct 277 ms 57412 KB Output is correct
48 Correct 276 ms 57408 KB Output is correct
49 Correct 225 ms 57408 KB Output is correct
50 Correct 221 ms 57396 KB Output is correct
51 Correct 223 ms 57420 KB Output is correct
52 Correct 224 ms 57408 KB Output is correct
53 Correct 222 ms 57408 KB Output is correct
54 Correct 976 ms 57180 KB Output is correct
55 Correct 1576 ms 56860 KB Output is correct
56 Correct 1215 ms 57252 KB Output is correct
57 Correct 2728 ms 245156 KB Output is correct
58 Correct 2435 ms 253396 KB Output is correct
59 Correct 2556 ms 253372 KB Output is correct
60 Correct 2642 ms 253512 KB Output is correct
61 Correct 2440 ms 253660 KB Output is correct
62 Correct 2619 ms 253520 KB Output is correct
63 Correct 1270 ms 252472 KB Output is correct
64 Correct 1241 ms 252524 KB Output is correct
65 Correct 1672 ms 253400 KB Output is correct
66 Correct 1572 ms 253600 KB Output is correct
67 Correct 1596 ms 253784 KB Output is correct
68 Correct 1553 ms 253436 KB Output is correct
69 Correct 1803 ms 253460 KB Output is correct
70 Correct 1612 ms 253896 KB Output is correct
71 Correct 1648 ms 253512 KB Output is correct
72 Correct 1716 ms 253612 KB Output is correct
73 Correct 1261 ms 252016 KB Output is correct
74 Correct 1235 ms 252508 KB Output is correct
75 Correct 1258 ms 252340 KB Output is correct
76 Correct 1234 ms 252004 KB Output is correct
77 Correct 1225 ms 252016 KB Output is correct
78 Execution timed out 3028 ms 241984 KB Time limit exceeded
79 Halted 0 ms 0 KB -