oj.uz

답안 #894209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894209 2023-12-28T02:55:18 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 252296 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);
            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();
            vec[dum].mn = vec[dum].mx = nodes[tl];
            vec[dum].v = {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]);
        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:59:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 460 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 344 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 460 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 344 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 2008 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 6 ms 2140 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 4 ms 2140 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2033 ms 252296 KB Output is correct
2 Correct 1930 ms 235072 KB Output is correct
3 Correct 2067 ms 234312 KB Output is correct
4 Correct 2128 ms 234732 KB Output is correct
5 Correct 1420 ms 234856 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 27844 KB Output is correct
2 Correct 157 ms 27936 KB Output is correct
3 Correct 116 ms 27960 KB Output is correct
4 Correct 113 ms 27844 KB Output is correct
5 Correct 114 ms 27844 KB Output is correct
6 Correct 88 ms 27972 KB Output is correct
7 Correct 91 ms 28068 KB Output is correct
8 Correct 318 ms 27944 KB Output is correct
9 Correct 37 ms 604 KB Output is correct
10 Correct 305 ms 28088 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 460 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 344 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 2008 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 6 ms 2140 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 4 ms 2140 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 336 ms 57268 KB Output is correct
20 Correct 360 ms 56488 KB Output is correct
21 Correct 297 ms 56424 KB Output is correct
22 Correct 268 ms 56356 KB Output is correct
23 Correct 317 ms 56952 KB Output is correct
24 Correct 198 ms 56844 KB Output is correct
25 Correct 190 ms 56852 KB Output is correct
26 Correct 254 ms 56340 KB Output is correct
27 Correct 242 ms 57500 KB Output is correct
28 Correct 274 ms 56624 KB Output is correct
29 Correct 239 ms 56484 KB Output is correct
30 Correct 258 ms 56464 KB Output is correct
31 Correct 280 ms 56668 KB Output is correct
32 Correct 293 ms 56364 KB Output is correct
33 Correct 284 ms 56456 KB Output is correct
34 Correct 210 ms 57368 KB Output is correct
35 Correct 197 ms 56692 KB Output is correct
36 Correct 209 ms 56512 KB Output is correct
37 Correct 209 ms 56340 KB Output is correct
38 Correct 203 ms 56296 KB Output is correct
39 Correct 1010 ms 56740 KB Output is correct
40 Correct 1676 ms 56088 KB Output is correct
41 Correct 1199 ms 57452 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 460 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 344 KB Output is correct
9 Correct 1 ms 504 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 2008 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 5 ms 2124 KB Output is correct
15 Correct 6 ms 2140 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 4 ms 2140 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 2033 ms 252296 KB Output is correct
20 Correct 1930 ms 235072 KB Output is correct
21 Correct 2067 ms 234312 KB Output is correct
22 Correct 2128 ms 234732 KB Output is correct
23 Correct 1420 ms 234856 KB Output is correct
24 Correct 168 ms 27844 KB Output is correct
25 Correct 157 ms 27936 KB Output is correct
26 Correct 116 ms 27960 KB Output is correct
27 Correct 113 ms 27844 KB Output is correct
28 Correct 114 ms 27844 KB Output is correct
29 Correct 88 ms 27972 KB Output is correct
30 Correct 91 ms 28068 KB Output is correct
31 Correct 318 ms 27944 KB Output is correct
32 Correct 37 ms 604 KB Output is correct
33 Correct 305 ms 28088 KB Output is correct
34 Correct 336 ms 57268 KB Output is correct
35 Correct 360 ms 56488 KB Output is correct
36 Correct 297 ms 56424 KB Output is correct
37 Correct 268 ms 56356 KB Output is correct
38 Correct 317 ms 56952 KB Output is correct
39 Correct 198 ms 56844 KB Output is correct
40 Correct 190 ms 56852 KB Output is correct
41 Correct 254 ms 56340 KB Output is correct
42 Correct 242 ms 57500 KB Output is correct
43 Correct 274 ms 56624 KB Output is correct
44 Correct 239 ms 56484 KB Output is correct
45 Correct 258 ms 56464 KB Output is correct
46 Correct 280 ms 56668 KB Output is correct
47 Correct 293 ms 56364 KB Output is correct
48 Correct 284 ms 56456 KB Output is correct
49 Correct 210 ms 57368 KB Output is correct
50 Correct 197 ms 56692 KB Output is correct
51 Correct 209 ms 56512 KB Output is correct
52 Correct 209 ms 56340 KB Output is correct
53 Correct 203 ms 56296 KB Output is correct
54 Correct 1010 ms 56740 KB Output is correct
55 Correct 1676 ms 56088 KB Output is correct
56 Correct 1199 ms 57452 KB Output is correct
57 Correct 2166 ms 235336 KB Output is correct
58 Correct 2185 ms 234992 KB Output is correct
59 Correct 2104 ms 234792 KB Output is correct
60 Correct 2063 ms 234868 KB Output is correct
61 Correct 2229 ms 234512 KB Output is correct
62 Correct 2147 ms 235272 KB Output is correct
63 Correct 1067 ms 234088 KB Output is correct
64 Correct 1052 ms 234760 KB Output is correct
65 Correct 1446 ms 235864 KB Output is correct
66 Correct 1388 ms 235956 KB Output is correct
67 Correct 1305 ms 235448 KB Output is correct
68 Correct 1353 ms 235284 KB Output is correct
69 Correct 1422 ms 234828 KB Output is correct
70 Correct 1457 ms 234980 KB Output is correct
71 Correct 1454 ms 235908 KB Output is correct
72 Correct 1435 ms 235472 KB Output is correct
73 Correct 1018 ms 234704 KB Output is correct
74 Correct 1028 ms 234668 KB Output is correct
75 Correct 1004 ms 234136 KB Output is correct
76 Correct 965 ms 236276 KB Output is correct
77 Correct 981 ms 235252 KB Output is correct
78 Execution timed out 3063 ms 234164 KB Time limit exceeded
79 Halted 0 ms 0 KB -