oj.uz

Submission #894298

# Submission time Handle Problem Language Result Execution time Memory
894298 2023-12-28T04:11:20 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 221892 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 val;
    vector<int> v;
    Node (int mx) {
        this->mx = mx, this->val = 0;
    }
};
struct SegmentTree {
    vector<Node> vec;
    vector<int> nodes;
    int sz;
    Node merge (Node &left, Node &right) {
        Node ans = {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.v[0] < left.mx) {
            ans.val = max(ans.val, *(--lower_bound(right.v.begin(), right.v.end(), left.mx)) + left.mx);
        }
        return ans;
    }
    int query (int l, int r) {
        r += 1;
        vector<int> vec1, vec2;
        for(l += sz , r += sz; l < r;l >>= 1 , r >>= 1){
            if(l&1){
                vec1.push_back(l++);
            }
            if(r&1){
                vec2.push_back(--r);
            }
        }
        reverse(vec2.begin(), vec2.end());
        for (int x: vec2) vec1.push_back(x);
        Node ans = vec[vec1[0]];
        for (int i = 1; i < vec1.size(); i++) {
            ans = merge(ans, vec[vec1[i]]);
        }
        return ans.val;
    }
    void build (int dum, int tl, int tr) {
        if (tl == tr) {
            vec[dum] = Node(nodes[tl]);
            vec[dum].v = {nodes[tl]};
        } else {
            build(2 * dum, tl, (tl + tr)/2), build(2 * dum + 1, (tl + tr)/2 + 1, tr);
            vec[dum] = merge(vec[2 * dum], vec[2 * dum + 1]);
            std::merge(vec[2 * dum].v.begin(), vec[2 * dum].v.end(),
                       vec[2 * dum + 1].v.begin(), vec[2 * dum + 1].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;
        this->sz = n;
        vec.assign(2 * n, Node(-INT_MAX));
        this->nodes.reserve(vec.size());
        while (this->nodes.size() < vec.size()) {
            this->nodes.push_back((int)1e9);
        }
        build( 1, 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:46:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |         for (int i = 1; i < vec1.size(); i++) {
      |                         ~~^~~~~~~~~~~~~

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

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2210 ms 221504 KB Output is correct
2 Correct 2185 ms 221640 KB Output is correct
3 Correct 2284 ms 221576 KB Output is correct
4 Correct 2160 ms 221720 KB Output is correct
5 Correct 1815 ms 221660 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 26320 KB Output is correct
2 Correct 154 ms 26312 KB Output is correct
3 Correct 128 ms 26324 KB Output is correct
4 Correct 140 ms 26324 KB Output is correct
5 Correct 125 ms 26316 KB Output is correct
6 Correct 104 ms 26308 KB Output is correct
7 Correct 104 ms 26316 KB Output is correct
8 Correct 323 ms 26324 KB Output is correct
9 Correct 43 ms 604 KB Output is correct
10 Correct 312 ms 26320 KB Output is correct

Subtask #5
30.0 / 30.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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 8 ms 1884 KB Output is correct
14 Correct 6 ms 1884 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 6 ms 1884 KB Output is correct
18 Correct 6 ms 1952 KB Output is correct
19 Correct 374 ms 53312 KB Output is correct
20 Correct 366 ms 53316 KB Output is correct
21 Correct 318 ms 53168 KB Output is correct
22 Correct 310 ms 53192 KB Output is correct
23 Correct 322 ms 53176 KB Output is correct
24 Correct 234 ms 53184 KB Output is correct
25 Correct 241 ms 53300 KB Output is correct
26 Correct 300 ms 53312 KB Output is correct
27 Correct 306 ms 53304 KB Output is correct
28 Correct 313 ms 53308 KB Output is correct
29 Correct 329 ms 53296 KB Output is correct
30 Correct 311 ms 53196 KB Output is correct
31 Correct 328 ms 53200 KB Output is correct
32 Correct 344 ms 53312 KB Output is correct
33 Correct 313 ms 53316 KB Output is correct
34 Correct 232 ms 53192 KB Output is correct
35 Correct 228 ms 53288 KB Output is correct
36 Correct 224 ms 53256 KB Output is correct
37 Correct 226 ms 53276 KB Output is correct
38 Correct 227 ms 53316 KB Output is correct
39 Correct 970 ms 53244 KB Output is correct
40 Correct 1552 ms 52580 KB Output is correct
41 Correct 1183 ms 53312 KB Output is correct

Subtask #6
0 / 23.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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 604 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 8 ms 1884 KB Output is correct
14 Correct 6 ms 1884 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 6 ms 1884 KB Output is correct
18 Correct 6 ms 1952 KB Output is correct
19 Correct 2210 ms 221504 KB Output is correct
20 Correct 2185 ms 221640 KB Output is correct
21 Correct 2284 ms 221576 KB Output is correct
22 Correct 2160 ms 221720 KB Output is correct
23 Correct 1815 ms 221660 KB Output is correct
24 Correct 157 ms 26320 KB Output is correct
25 Correct 154 ms 26312 KB Output is correct
26 Correct 128 ms 26324 KB Output is correct
27 Correct 140 ms 26324 KB Output is correct
28 Correct 125 ms 26316 KB Output is correct
29 Correct 104 ms 26308 KB Output is correct
30 Correct 104 ms 26316 KB Output is correct
31 Correct 323 ms 26324 KB Output is correct
32 Correct 43 ms 604 KB Output is correct
33 Correct 312 ms 26320 KB Output is correct
34 Correct 374 ms 53312 KB Output is correct
35 Correct 366 ms 53316 KB Output is correct
36 Correct 318 ms 53168 KB Output is correct
37 Correct 310 ms 53192 KB Output is correct
38 Correct 322 ms 53176 KB Output is correct
39 Correct 234 ms 53184 KB Output is correct
40 Correct 241 ms 53300 KB Output is correct
41 Correct 300 ms 53312 KB Output is correct
42 Correct 306 ms 53304 KB Output is correct
43 Correct 313 ms 53308 KB Output is correct
44 Correct 329 ms 53296 KB Output is correct
45 Correct 311 ms 53196 KB Output is correct
46 Correct 328 ms 53200 KB Output is correct
47 Correct 344 ms 53312 KB Output is correct
48 Correct 313 ms 53316 KB Output is correct
49 Correct 232 ms 53192 KB Output is correct
50 Correct 228 ms 53288 KB Output is correct
51 Correct 224 ms 53256 KB Output is correct
52 Correct 226 ms 53276 KB Output is correct
53 Correct 227 ms 53316 KB Output is correct
54 Correct 970 ms 53244 KB Output is correct
55 Correct 1552 ms 52580 KB Output is correct
56 Correct 1183 ms 53312 KB Output is correct
57 Correct 2291 ms 221504 KB Output is correct
58 Correct 2195 ms 221628 KB Output is correct
59 Correct 2223 ms 221496 KB Output is correct
60 Correct 2168 ms 221636 KB Output is correct
61 Correct 2090 ms 221892 KB Output is correct
62 Correct 2151 ms 221588 KB Output is correct
63 Correct 1169 ms 221456 KB Output is correct
64 Correct 1159 ms 221456 KB Output is correct
65 Correct 1764 ms 221456 KB Output is correct
66 Correct 1745 ms 221672 KB Output is correct
67 Correct 1753 ms 221456 KB Output is correct
68 Correct 1764 ms 221632 KB Output is correct
69 Correct 1775 ms 221452 KB Output is correct
70 Correct 1768 ms 221708 KB Output is correct
71 Correct 1767 ms 221460 KB Output is correct
72 Correct 1756 ms 221496 KB Output is correct
73 Correct 1165 ms 221744 KB Output is correct
74 Correct 1169 ms 221840 KB Output is correct
75 Correct 1164 ms 221564 KB Output is correct
76 Correct 1178 ms 221652 KB Output is correct
77 Correct 1166 ms 221708 KB Output is correct
78 Execution timed out 3048 ms 221456 KB Time limit exceeded
79 Halted 0 ms 0 KB -