oj.uz

답안 #894268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894268 2023-12-28T03:13:22 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 260996 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;
    }
    Node (int mn, int mx) {
        this->mx = mx, this->mn = mn, this->val = 0;
    }
} vec[(int)2097152];
struct SegmentTree {
    vector<int> nodes;
    int n;
    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) {
            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, n - 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]);
        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;
        this->n = nodes.size();
        this->n = (1 << (int)log2(n)) * 2;
        this->nodes.reserve(2 * n);
        while (this->nodes.size() < 2 * n) {
            this->nodes.push_back((int)1e9);
        }
        build(0, 0, n - 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:57:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~
sortbooks.cpp: In constructor 'SegmentTree::SegmentTree(std::vector<int>)':
sortbooks.cpp:80:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   80 |         while (this->nodes.size() < 2 * n) {
      |                ~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 82524 KB Output is correct
2 Correct 17 ms 82524 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82328 KB Output is correct
5 Correct 17 ms 82524 KB Output is correct
6 Correct 18 ms 82580 KB Output is correct
7 Correct 18 ms 82392 KB Output is correct
8 Correct 18 ms 82524 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 18 ms 82524 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 82524 KB Output is correct
2 Correct 17 ms 82524 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82328 KB Output is correct
5 Correct 17 ms 82524 KB Output is correct
6 Correct 18 ms 82580 KB Output is correct
7 Correct 18 ms 82392 KB Output is correct
8 Correct 18 ms 82524 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 18 ms 82524 KB Output is correct
11 Correct 19 ms 82524 KB Output is correct
12 Correct 21 ms 83416 KB Output is correct
13 Correct 22 ms 83288 KB Output is correct
14 Correct 23 ms 83548 KB Output is correct
15 Correct 23 ms 83292 KB Output is correct
16 Correct 23 ms 83328 KB Output is correct
17 Correct 22 ms 83544 KB Output is correct
18 Correct 23 ms 83292 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2096 ms 249056 KB Output is correct
2 Correct 2035 ms 258988 KB Output is correct
3 Correct 2207 ms 258524 KB Output is correct
4 Correct 2098 ms 259844 KB Output is correct
5 Correct 1391 ms 260012 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 161 ms 99528 KB Output is correct
2 Correct 157 ms 99804 KB Output is correct
3 Correct 120 ms 99648 KB Output is correct
4 Correct 113 ms 99648 KB Output is correct
5 Correct 118 ms 99908 KB Output is correct
6 Correct 100 ms 99640 KB Output is correct
7 Correct 104 ms 99632 KB Output is correct
8 Correct 325 ms 99780 KB Output is correct
9 Correct 53 ms 82772 KB Output is correct
10 Correct 302 ms 99624 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 82524 KB Output is correct
2 Correct 17 ms 82524 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82328 KB Output is correct
5 Correct 17 ms 82524 KB Output is correct
6 Correct 18 ms 82580 KB Output is correct
7 Correct 18 ms 82392 KB Output is correct
8 Correct 18 ms 82524 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 18 ms 82524 KB Output is correct
11 Correct 19 ms 82524 KB Output is correct
12 Correct 21 ms 83416 KB Output is correct
13 Correct 22 ms 83288 KB Output is correct
14 Correct 23 ms 83548 KB Output is correct
15 Correct 23 ms 83292 KB Output is correct
16 Correct 23 ms 83328 KB Output is correct
17 Correct 22 ms 83544 KB Output is correct
18 Correct 23 ms 83292 KB Output is correct
19 Correct 361 ms 117824 KB Output is correct
20 Correct 341 ms 118068 KB Output is correct
21 Correct 298 ms 117912 KB Output is correct
22 Correct 293 ms 118068 KB Output is correct
23 Correct 293 ms 117952 KB Output is correct
24 Correct 219 ms 118068 KB Output is correct
25 Correct 218 ms 118072 KB Output is correct
26 Correct 248 ms 118320 KB Output is correct
27 Correct 235 ms 117992 KB Output is correct
28 Correct 250 ms 118080 KB Output is correct
29 Correct 262 ms 117976 KB Output is correct
30 Correct 266 ms 117800 KB Output is correct
31 Correct 264 ms 118068 KB Output is correct
32 Correct 272 ms 118064 KB Output is correct
33 Correct 261 ms 117944 KB Output is correct
34 Correct 210 ms 117928 KB Output is correct
35 Correct 225 ms 117852 KB Output is correct
36 Correct 236 ms 118128 KB Output is correct
37 Correct 209 ms 117916 KB Output is correct
38 Correct 216 ms 118036 KB Output is correct
39 Correct 981 ms 118100 KB Output is correct
40 Correct 1569 ms 118024 KB Output is correct
41 Correct 1173 ms 118488 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 82524 KB Output is correct
2 Correct 17 ms 82524 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82328 KB Output is correct
5 Correct 17 ms 82524 KB Output is correct
6 Correct 18 ms 82580 KB Output is correct
7 Correct 18 ms 82392 KB Output is correct
8 Correct 18 ms 82524 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 18 ms 82524 KB Output is correct
11 Correct 19 ms 82524 KB Output is correct
12 Correct 21 ms 83416 KB Output is correct
13 Correct 22 ms 83288 KB Output is correct
14 Correct 23 ms 83548 KB Output is correct
15 Correct 23 ms 83292 KB Output is correct
16 Correct 23 ms 83328 KB Output is correct
17 Correct 22 ms 83544 KB Output is correct
18 Correct 23 ms 83292 KB Output is correct
19 Correct 2096 ms 249056 KB Output is correct
20 Correct 2035 ms 258988 KB Output is correct
21 Correct 2207 ms 258524 KB Output is correct
22 Correct 2098 ms 259844 KB Output is correct
23 Correct 1391 ms 260012 KB Output is correct
24 Correct 161 ms 99528 KB Output is correct
25 Correct 157 ms 99804 KB Output is correct
26 Correct 120 ms 99648 KB Output is correct
27 Correct 113 ms 99648 KB Output is correct
28 Correct 118 ms 99908 KB Output is correct
29 Correct 100 ms 99640 KB Output is correct
30 Correct 104 ms 99632 KB Output is correct
31 Correct 325 ms 99780 KB Output is correct
32 Correct 53 ms 82772 KB Output is correct
33 Correct 302 ms 99624 KB Output is correct
34 Correct 361 ms 117824 KB Output is correct
35 Correct 341 ms 118068 KB Output is correct
36 Correct 298 ms 117912 KB Output is correct
37 Correct 293 ms 118068 KB Output is correct
38 Correct 293 ms 117952 KB Output is correct
39 Correct 219 ms 118068 KB Output is correct
40 Correct 218 ms 118072 KB Output is correct
41 Correct 248 ms 118320 KB Output is correct
42 Correct 235 ms 117992 KB Output is correct
43 Correct 250 ms 118080 KB Output is correct
44 Correct 262 ms 117976 KB Output is correct
45 Correct 266 ms 117800 KB Output is correct
46 Correct 264 ms 118068 KB Output is correct
47 Correct 272 ms 118064 KB Output is correct
48 Correct 261 ms 117944 KB Output is correct
49 Correct 210 ms 117928 KB Output is correct
50 Correct 225 ms 117852 KB Output is correct
51 Correct 236 ms 118128 KB Output is correct
52 Correct 209 ms 117916 KB Output is correct
53 Correct 216 ms 118036 KB Output is correct
54 Correct 981 ms 118100 KB Output is correct
55 Correct 1569 ms 118024 KB Output is correct
56 Correct 1173 ms 118488 KB Output is correct
57 Correct 2094 ms 259644 KB Output is correct
58 Correct 2085 ms 260316 KB Output is correct
59 Correct 2037 ms 260384 KB Output is correct
60 Correct 1973 ms 260484 KB Output is correct
61 Correct 2029 ms 260996 KB Output is correct
62 Correct 2092 ms 260176 KB Output is correct
63 Correct 1020 ms 258848 KB Output is correct
64 Correct 1020 ms 259548 KB Output is correct
65 Correct 1417 ms 260312 KB Output is correct
66 Correct 1380 ms 252804 KB Output is correct
67 Correct 1383 ms 252940 KB Output is correct
68 Correct 1426 ms 252912 KB Output is correct
69 Correct 1407 ms 251292 KB Output is correct
70 Correct 1384 ms 252988 KB Output is correct
71 Correct 1390 ms 252624 KB Output is correct
72 Correct 1372 ms 251180 KB Output is correct
73 Correct 1058 ms 249816 KB Output is correct
74 Correct 1063 ms 250288 KB Output is correct
75 Correct 1075 ms 249780 KB Output is correct
76 Correct 1046 ms 249924 KB Output is correct
77 Correct 1081 ms 249764 KB Output is correct
78 Execution timed out 3087 ms 239432 KB Time limit exceeded
79 Halted 0 ms 0 KB -