oj.uz

Submission #894279

# Submission time Handle Problem Language Result Execution time Memory
894279 2023-12-28T03:30:54 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 253452 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) {
            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:44:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         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 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 348 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 0 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 348 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 4 ms 860 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 6 ms 1884 KB Output is correct
15 Correct 7 ms 2140 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 5 ms 1884 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2291 ms 244192 KB Output is correct
2 Correct 2100 ms 253384 KB Output is correct
3 Correct 2168 ms 253452 KB Output is correct
4 Correct 2272 ms 253268 KB Output is correct
5 Correct 1740 ms 253356 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 29468 KB Output is correct
2 Correct 158 ms 29252 KB Output is correct
3 Correct 117 ms 29600 KB Output is correct
4 Correct 113 ms 29428 KB Output is correct
5 Correct 118 ms 29404 KB Output is correct
6 Correct 93 ms 29080 KB Output is correct
7 Correct 110 ms 29236 KB Output is correct
8 Correct 301 ms 29196 KB Output is correct
9 Correct 38 ms 1780 KB Output is correct
10 Correct 329 ms 29284 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 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 348 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 4 ms 860 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 6 ms 1884 KB Output is correct
15 Correct 7 ms 2140 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 5 ms 1884 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 354 ms 60724 KB Output is correct
20 Correct 343 ms 60676 KB Output is correct
21 Correct 371 ms 60680 KB Output is correct
22 Correct 346 ms 60804 KB Output is correct
23 Correct 273 ms 60792 KB Output is correct
24 Correct 238 ms 60468 KB Output is correct
25 Correct 241 ms 60624 KB Output is correct
26 Correct 291 ms 61096 KB Output is correct
27 Correct 260 ms 60840 KB Output is correct
28 Correct 265 ms 60988 KB Output is correct
29 Correct 264 ms 60720 KB Output is correct
30 Correct 295 ms 61020 KB Output is correct
31 Correct 266 ms 60724 KB Output is correct
32 Correct 285 ms 60676 KB Output is correct
33 Correct 274 ms 60736 KB Output is correct
34 Correct 263 ms 60544 KB Output is correct
35 Correct 199 ms 60504 KB Output is correct
36 Correct 210 ms 60564 KB Output is correct
37 Correct 210 ms 60432 KB Output is correct
38 Correct 201 ms 60464 KB Output is correct
39 Correct 962 ms 60372 KB Output is correct
40 Correct 1542 ms 59312 KB Output is correct
41 Correct 1171 ms 59900 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 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 348 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 4 ms 860 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 6 ms 1884 KB Output is correct
15 Correct 7 ms 2140 KB Output is correct
16 Correct 6 ms 1884 KB Output is correct
17 Correct 5 ms 1884 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 2291 ms 244192 KB Output is correct
20 Correct 2100 ms 253384 KB Output is correct
21 Correct 2168 ms 253452 KB Output is correct
22 Correct 2272 ms 253268 KB Output is correct
23 Correct 1740 ms 253356 KB Output is correct
24 Correct 146 ms 29468 KB Output is correct
25 Correct 158 ms 29252 KB Output is correct
26 Correct 117 ms 29600 KB Output is correct
27 Correct 113 ms 29428 KB Output is correct
28 Correct 118 ms 29404 KB Output is correct
29 Correct 93 ms 29080 KB Output is correct
30 Correct 110 ms 29236 KB Output is correct
31 Correct 301 ms 29196 KB Output is correct
32 Correct 38 ms 1780 KB Output is correct
33 Correct 329 ms 29284 KB Output is correct
34 Correct 354 ms 60724 KB Output is correct
35 Correct 343 ms 60676 KB Output is correct
36 Correct 371 ms 60680 KB Output is correct
37 Correct 346 ms 60804 KB Output is correct
38 Correct 273 ms 60792 KB Output is correct
39 Correct 238 ms 60468 KB Output is correct
40 Correct 241 ms 60624 KB Output is correct
41 Correct 291 ms 61096 KB Output is correct
42 Correct 260 ms 60840 KB Output is correct
43 Correct 265 ms 60988 KB Output is correct
44 Correct 264 ms 60720 KB Output is correct
45 Correct 295 ms 61020 KB Output is correct
46 Correct 266 ms 60724 KB Output is correct
47 Correct 285 ms 60676 KB Output is correct
48 Correct 274 ms 60736 KB Output is correct
49 Correct 263 ms 60544 KB Output is correct
50 Correct 199 ms 60504 KB Output is correct
51 Correct 210 ms 60564 KB Output is correct
52 Correct 210 ms 60432 KB Output is correct
53 Correct 201 ms 60464 KB Output is correct
54 Correct 962 ms 60372 KB Output is correct
55 Correct 1542 ms 59312 KB Output is correct
56 Correct 1171 ms 59900 KB Output is correct
57 Correct 2354 ms 246748 KB Output is correct
58 Correct 2032 ms 238092 KB Output is correct
59 Correct 2096 ms 238104 KB Output is correct
60 Correct 2009 ms 238048 KB Output is correct
61 Correct 2057 ms 238092 KB Output is correct
62 Correct 2088 ms 237896 KB Output is correct
63 Correct 1102 ms 238036 KB Output is correct
64 Correct 1000 ms 237908 KB Output is correct
65 Correct 1435 ms 238016 KB Output is correct
66 Correct 1413 ms 238024 KB Output is correct
67 Correct 1529 ms 238096 KB Output is correct
68 Correct 1430 ms 238028 KB Output is correct
69 Correct 1368 ms 238096 KB Output is correct
70 Correct 1419 ms 237920 KB Output is correct
71 Correct 1439 ms 237940 KB Output is correct
72 Correct 1382 ms 237976 KB Output is correct
73 Correct 1024 ms 238092 KB Output is correct
74 Correct 1016 ms 238176 KB Output is correct
75 Correct 1036 ms 238032 KB Output is correct
76 Correct 1037 ms 238108 KB Output is correct
77 Correct 1014 ms 238096 KB Output is correct
78 Execution timed out 3099 ms 238032 KB Time limit exceeded
79 Halted 0 ms 0 KB -