oj.uz

답안 #894228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894228 2023-12-28T03:00:40 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 252968 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 () {
        this->mx = INT_MIN, this->mn = INT_MAX, this->val = 0;
    }
};
struct SegmentTree {
    vector<Node> vec;
    vector<int> nodes;
    Node merge (Node &left, Node &right) {
        Node ans = {};
        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) {
            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, right.v[l] + 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();
            vec[dum].mn = vec[dum].mx = 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]);
        vec[dum].v.reserve(vec[2 * dum + 1].v.size() + vec[2 * dum + 2].v.size());
        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());
        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:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
8 Correct 1 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
8 Correct 1 ms 348 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 692 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 4 ms 1884 KB Output is correct
14 Correct 6 ms 2136 KB Output is correct
15 Correct 6 ms 1884 KB Output is correct
16 Correct 5 ms 1884 KB Output is correct
17 Correct 4 ms 1880 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2053 ms 235752 KB Output is correct
2 Correct 2039 ms 235144 KB Output is correct
3 Correct 2053 ms 235856 KB Output is correct
4 Correct 2035 ms 234972 KB Output is correct
5 Correct 1364 ms 234972 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 27844 KB Output is correct
2 Correct 133 ms 27844 KB Output is correct
3 Correct 108 ms 27964 KB Output is correct
4 Correct 103 ms 27844 KB Output is correct
5 Correct 101 ms 27800 KB Output is correct
6 Correct 92 ms 27908 KB Output is correct
7 Correct 86 ms 27892 KB Output is correct
8 Correct 298 ms 27820 KB Output is correct
9 Correct 37 ms 740 KB Output is correct
10 Correct 320 ms 27952 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
8 Correct 1 ms 348 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 692 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 4 ms 1884 KB Output is correct
14 Correct 6 ms 2136 KB Output is correct
15 Correct 6 ms 1884 KB Output is correct
16 Correct 5 ms 1884 KB Output is correct
17 Correct 4 ms 1880 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 334 ms 56272 KB Output is correct
20 Correct 325 ms 57380 KB Output is correct
21 Correct 266 ms 56612 KB Output is correct
22 Correct 265 ms 57368 KB Output is correct
23 Correct 268 ms 56360 KB Output is correct
24 Correct 190 ms 56792 KB Output is correct
25 Correct 192 ms 56356 KB Output is correct
26 Correct 219 ms 56352 KB Output is correct
27 Correct 244 ms 57340 KB Output is correct
28 Correct 234 ms 56616 KB Output is correct
29 Correct 246 ms 56656 KB Output is correct
30 Correct 266 ms 56260 KB Output is correct
31 Correct 235 ms 57076 KB Output is correct
32 Correct 270 ms 57396 KB Output is correct
33 Correct 270 ms 57200 KB Output is correct
34 Correct 190 ms 56512 KB Output is correct
35 Correct 193 ms 56680 KB Output is correct
36 Correct 195 ms 56360 KB Output is correct
37 Correct 201 ms 56616 KB Output is correct
38 Correct 206 ms 57108 KB Output is correct
39 Correct 969 ms 57672 KB Output is correct
40 Correct 1598 ms 56244 KB Output is correct
41 Correct 1267 ms 56444 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 348 KB Output is correct
8 Correct 1 ms 348 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 692 KB Output is correct
12 Correct 4 ms 1884 KB Output is correct
13 Correct 4 ms 1884 KB Output is correct
14 Correct 6 ms 2136 KB Output is correct
15 Correct 6 ms 1884 KB Output is correct
16 Correct 5 ms 1884 KB Output is correct
17 Correct 4 ms 1880 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 2053 ms 235752 KB Output is correct
20 Correct 2039 ms 235144 KB Output is correct
21 Correct 2053 ms 235856 KB Output is correct
22 Correct 2035 ms 234972 KB Output is correct
23 Correct 1364 ms 234972 KB Output is correct
24 Correct 145 ms 27844 KB Output is correct
25 Correct 133 ms 27844 KB Output is correct
26 Correct 108 ms 27964 KB Output is correct
27 Correct 103 ms 27844 KB Output is correct
28 Correct 101 ms 27800 KB Output is correct
29 Correct 92 ms 27908 KB Output is correct
30 Correct 86 ms 27892 KB Output is correct
31 Correct 298 ms 27820 KB Output is correct
32 Correct 37 ms 740 KB Output is correct
33 Correct 320 ms 27952 KB Output is correct
34 Correct 334 ms 56272 KB Output is correct
35 Correct 325 ms 57380 KB Output is correct
36 Correct 266 ms 56612 KB Output is correct
37 Correct 265 ms 57368 KB Output is correct
38 Correct 268 ms 56360 KB Output is correct
39 Correct 190 ms 56792 KB Output is correct
40 Correct 192 ms 56356 KB Output is correct
41 Correct 219 ms 56352 KB Output is correct
42 Correct 244 ms 57340 KB Output is correct
43 Correct 234 ms 56616 KB Output is correct
44 Correct 246 ms 56656 KB Output is correct
45 Correct 266 ms 56260 KB Output is correct
46 Correct 235 ms 57076 KB Output is correct
47 Correct 270 ms 57396 KB Output is correct
48 Correct 270 ms 57200 KB Output is correct
49 Correct 190 ms 56512 KB Output is correct
50 Correct 193 ms 56680 KB Output is correct
51 Correct 195 ms 56360 KB Output is correct
52 Correct 201 ms 56616 KB Output is correct
53 Correct 206 ms 57108 KB Output is correct
54 Correct 969 ms 57672 KB Output is correct
55 Correct 1598 ms 56244 KB Output is correct
56 Correct 1267 ms 56444 KB Output is correct
57 Correct 2466 ms 243084 KB Output is correct
58 Correct 2219 ms 251796 KB Output is correct
59 Correct 2343 ms 252528 KB Output is correct
60 Correct 2084 ms 252240 KB Output is correct
61 Correct 2157 ms 252604 KB Output is correct
62 Correct 2136 ms 252968 KB Output is correct
63 Correct 1048 ms 251220 KB Output is correct
64 Correct 1255 ms 250728 KB Output is correct
65 Correct 1537 ms 251936 KB Output is correct
66 Correct 1593 ms 252436 KB Output is correct
67 Correct 1520 ms 251360 KB Output is correct
68 Correct 1584 ms 252160 KB Output is correct
69 Correct 1531 ms 250716 KB Output is correct
70 Correct 1572 ms 252828 KB Output is correct
71 Correct 1510 ms 252400 KB Output is correct
72 Correct 1479 ms 251824 KB Output is correct
73 Correct 1086 ms 250656 KB Output is correct
74 Correct 1138 ms 251436 KB Output is correct
75 Correct 1074 ms 250820 KB Output is correct
76 Correct 1075 ms 251632 KB Output is correct
77 Correct 1073 ms 251620 KB Output is correct
78 Execution timed out 3093 ms 240528 KB Time limit exceeded
79 Halted 0 ms 0 KB -