oj.uz

답안 #894198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894198 2023-12-28T02:50:27 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 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;
    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]);
        for (int x: vec[2 * dum + 1].v) {
            vec[dum].v.push_back(x);
        }
        for (int x: vec[2 * dum + 2].v) {
            vec[dum].v.push_back(x);
        }
        sort(vec[dum].v.begin(), vec[dum].v.end());
    }
    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 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 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 344 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 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 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 344 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 6 ms 2092 KB Output is correct
13 Correct 6 ms 1884 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 1880 KB Output is correct
17 Correct 6 ms 2112 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2630 ms 254116 KB Output is correct
2 Correct 2628 ms 262144 KB Output is correct
3 Correct 2684 ms 262144 KB Output is correct
4 Correct 2637 ms 262144 KB Output is correct
5 Correct 1509 ms 262144 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 178 ms 28284 KB Output is correct
2 Correct 187 ms 28368 KB Output is correct
3 Correct 128 ms 28348 KB Output is correct
4 Correct 115 ms 28348 KB Output is correct
5 Correct 114 ms 28176 KB Output is correct
6 Correct 105 ms 28348 KB Output is correct
7 Correct 101 ms 28308 KB Output is correct
8 Correct 319 ms 28880 KB Output is correct
9 Correct 35 ms 764 KB Output is correct
10 Correct 336 ms 28344 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 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 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 344 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 6 ms 2092 KB Output is correct
13 Correct 6 ms 1884 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 1880 KB Output is correct
17 Correct 6 ms 2112 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 430 ms 57384 KB Output is correct
20 Correct 430 ms 57416 KB Output is correct
21 Correct 373 ms 57376 KB Output is correct
22 Correct 368 ms 57436 KB Output is correct
23 Correct 400 ms 57384 KB Output is correct
24 Correct 226 ms 57384 KB Output is correct
25 Correct 231 ms 57384 KB Output is correct
26 Correct 268 ms 57640 KB Output is correct
27 Correct 250 ms 57384 KB Output is correct
28 Correct 272 ms 57380 KB Output is correct
29 Correct 269 ms 57376 KB Output is correct
30 Correct 291 ms 58156 KB Output is correct
31 Correct 276 ms 57520 KB Output is correct
32 Correct 271 ms 58464 KB Output is correct
33 Correct 299 ms 57256 KB Output is correct
34 Correct 224 ms 57384 KB Output is correct
35 Correct 223 ms 57344 KB Output is correct
36 Correct 226 ms 58388 KB Output is correct
37 Correct 220 ms 57380 KB Output is correct
38 Correct 221 ms 57380 KB Output is correct
39 Correct 963 ms 60728 KB Output is correct
40 Correct 1596 ms 61248 KB Output is correct
41 Correct 1180 ms 61704 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 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 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 344 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 6 ms 2092 KB Output is correct
13 Correct 6 ms 1884 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 1880 KB Output is correct
17 Correct 6 ms 2112 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 2630 ms 254116 KB Output is correct
20 Correct 2628 ms 262144 KB Output is correct
21 Correct 2684 ms 262144 KB Output is correct
22 Correct 2637 ms 262144 KB Output is correct
23 Correct 1509 ms 262144 KB Output is correct
24 Correct 178 ms 28284 KB Output is correct
25 Correct 187 ms 28368 KB Output is correct
26 Correct 128 ms 28348 KB Output is correct
27 Correct 115 ms 28348 KB Output is correct
28 Correct 114 ms 28176 KB Output is correct
29 Correct 105 ms 28348 KB Output is correct
30 Correct 101 ms 28308 KB Output is correct
31 Correct 319 ms 28880 KB Output is correct
32 Correct 35 ms 764 KB Output is correct
33 Correct 336 ms 28344 KB Output is correct
34 Correct 430 ms 57384 KB Output is correct
35 Correct 430 ms 57416 KB Output is correct
36 Correct 373 ms 57376 KB Output is correct
37 Correct 368 ms 57436 KB Output is correct
38 Correct 400 ms 57384 KB Output is correct
39 Correct 226 ms 57384 KB Output is correct
40 Correct 231 ms 57384 KB Output is correct
41 Correct 268 ms 57640 KB Output is correct
42 Correct 250 ms 57384 KB Output is correct
43 Correct 272 ms 57380 KB Output is correct
44 Correct 269 ms 57376 KB Output is correct
45 Correct 291 ms 58156 KB Output is correct
46 Correct 276 ms 57520 KB Output is correct
47 Correct 271 ms 58464 KB Output is correct
48 Correct 299 ms 57256 KB Output is correct
49 Correct 224 ms 57384 KB Output is correct
50 Correct 223 ms 57344 KB Output is correct
51 Correct 226 ms 58388 KB Output is correct
52 Correct 220 ms 57380 KB Output is correct
53 Correct 221 ms 57380 KB Output is correct
54 Correct 963 ms 60728 KB Output is correct
55 Correct 1596 ms 61248 KB Output is correct
56 Correct 1180 ms 61704 KB Output is correct
57 Correct 2903 ms 262144 KB Output is correct
58 Correct 2849 ms 262144 KB Output is correct
59 Correct 2717 ms 262144 KB Output is correct
60 Correct 2691 ms 262144 KB Output is correct
61 Correct 2775 ms 262144 KB Output is correct
62 Correct 2821 ms 262144 KB Output is correct
63 Correct 1255 ms 262144 KB Output is correct
64 Correct 1236 ms 262144 KB Output is correct
65 Correct 1644 ms 262144 KB Output is correct
66 Correct 1636 ms 262144 KB Output is correct
67 Correct 1600 ms 262144 KB Output is correct
68 Correct 1720 ms 262144 KB Output is correct
69 Correct 1517 ms 262144 KB Output is correct
70 Correct 1546 ms 262144 KB Output is correct
71 Correct 1493 ms 262144 KB Output is correct
72 Correct 1547 ms 262144 KB Output is correct
73 Correct 1140 ms 262144 KB Output is correct
74 Correct 1156 ms 262144 KB Output is correct
75 Correct 1135 ms 262144 KB Output is correct
76 Correct 1152 ms 262144 KB Output is correct
77 Correct 1161 ms 262144 KB Output is correct
78 Execution timed out 3024 ms 246508 KB Time limit exceeded
79 Halted 0 ms 0 KB -