oj.uz

Submission #894186

# Submission time Handle Problem Language Result Execution time Memory
894186 2023-12-28T02:29:30 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
34 / 100
 3000 ms 262144 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;
    int l;
    int r;
    set<int> s;
    Node (int l, int r) {
        this->mx = INT_MIN, this->mn = INT_MAX, this->val = 0, this->l = l, this->r = r;
    }
};
struct SegmentTree {
    vector<Node> vec;
    vector<int> nodes;
    Node merge (Node &left, Node &right) {
        Node ans = Node(left.l, right.r);
        ans.mn = min(left.mn, right.mn);
        ans.mx = 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, *(--right.s.lower_bound(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);
            return;
        }
        if (tl > r || tr < l) {
            return;
        }
        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(tl, tr);
            vec[dum].mn = vec[dum].mx = nodes[tl];
            vec[dum].s = {nodes[tl]};
            return;
        }
        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]);
        for (int x: vec[2 * dum + 1].s) {
            vec[dum].s.insert(x);
        }
        for (int x: vec[2 * dum + 2].s) {
            vec[dum].s.insert(x);
        }
    }
    SegmentTree (vector<int> nodes) {
        this->nodes = nodes;
        int n = nodes.size();
        n = (1 << (int)log2(n)) * 2;
        vec.assign(2 * n, Node(0, 0));
        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:51:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |         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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 1628 KB Output is correct
12 Correct 11 ms 5212 KB Output is correct
13 Correct 11 ms 5272 KB Output is correct
14 Correct 13 ms 5320 KB Output is correct
15 Correct 13 ms 5384 KB Output is correct
16 Correct 115 ms 5472 KB Output is correct
17 Correct 215 ms 4956 KB Output is correct
18 Correct 5 ms 2392 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 298 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 75828 KB Output is correct
2 Correct 333 ms 77616 KB Output is correct
3 Correct 123 ms 35380 KB Output is correct
4 Correct 128 ms 35724 KB Output is correct
5 Correct 119 ms 35476 KB Output is correct
6 Correct 99 ms 35456 KB Output is correct
7 Correct 97 ms 35632 KB Output is correct
8 Correct 118 ms 34600 KB Output is correct
9 Correct 475 ms 2368 KB Output is correct
10 Correct 101 ms 34332 KB Output is correct

Subtask #5
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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 1628 KB Output is correct
12 Correct 11 ms 5212 KB Output is correct
13 Correct 11 ms 5272 KB Output is correct
14 Correct 13 ms 5320 KB Output is correct
15 Correct 13 ms 5384 KB Output is correct
16 Correct 115 ms 5472 KB Output is correct
17 Correct 215 ms 4956 KB Output is correct
18 Correct 5 ms 2392 KB Output is correct
19 Correct 1096 ms 232400 KB Output is correct
20 Correct 1098 ms 237720 KB Output is correct
21 Correct 908 ms 237672 KB Output is correct
22 Correct 903 ms 237944 KB Output is correct
23 Correct 955 ms 237624 KB Output is correct
24 Correct 752 ms 237696 KB Output is correct
25 Correct 736 ms 238396 KB Output is correct
26 Correct 722 ms 237848 KB Output is correct
27 Correct 739 ms 237336 KB Output is correct
28 Correct 744 ms 235476 KB Output is correct
29 Correct 745 ms 238356 KB Output is correct
30 Correct 719 ms 235016 KB Output is correct
31 Correct 740 ms 232828 KB Output is correct
32 Correct 742 ms 238356 KB Output is correct
33 Correct 737 ms 233492 KB Output is correct
34 Correct 1246 ms 237204 KB Output is correct
35 Correct 1279 ms 237164 KB Output is correct
36 Correct 1322 ms 237640 KB Output is correct
37 Correct 1204 ms 238312 KB Output is correct
38 Correct 1299 ms 237424 KB Output is correct
39 Execution timed out 3074 ms 232728 KB Time limit exceeded
40 Halted 0 ms 0 KB -

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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 1628 KB Output is correct
12 Correct 11 ms 5212 KB Output is correct
13 Correct 11 ms 5272 KB Output is correct
14 Correct 13 ms 5320 KB Output is correct
15 Correct 13 ms 5384 KB Output is correct
16 Correct 115 ms 5472 KB Output is correct
17 Correct 215 ms 4956 KB Output is correct
18 Correct 5 ms 2392 KB Output is correct
19 Runtime error 298 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -