oj.uz

답안 #894269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894269 2023-12-28T03:16:30 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 234436 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();
        intervals.reserve(10);
        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:58:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~
sortbooks.cpp: In constructor 'SegmentTree::SegmentTree(std::vector<int>)':
sortbooks.cpp:81:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   81 |         while (this->nodes.size() < 2 * n) {
      |                ~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 82520 KB Output is correct
2 Correct 18 ms 82388 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 19 ms 82524 KB Output is correct
6 Correct 18 ms 82524 KB Output is correct
7 Correct 18 ms 82524 KB Output is correct
8 Correct 18 ms 82520 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 19 ms 82520 KB Output is correct
11 Correct 21 ms 82524 KB Output is correct
12 Correct 23 ms 83288 KB Output is correct
13 Correct 24 ms 83472 KB Output is correct
14 Correct 23 ms 83288 KB Output is correct
15 Correct 23 ms 83292 KB Output is correct
16 Correct 22 ms 83292 KB Output is correct
17 Correct 22 ms 83292 KB Output is correct
18 Correct 22 ms 83292 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2155 ms 234124 KB Output is correct
2 Correct 1999 ms 233996 KB Output is correct
3 Correct 2061 ms 233996 KB Output is correct
4 Correct 2041 ms 234000 KB Output is correct
5 Correct 1379 ms 233960 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 173 ms 99612 KB Output is correct
2 Correct 157 ms 99652 KB Output is correct
3 Correct 112 ms 99648 KB Output is correct
4 Correct 114 ms 99648 KB Output is correct
5 Correct 114 ms 99552 KB Output is correct
6 Correct 112 ms 99688 KB Output is correct
7 Correct 99 ms 99748 KB Output is correct
8 Correct 323 ms 99652 KB Output is correct
9 Correct 54 ms 83188 KB Output is correct
10 Correct 336 ms 99736 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 82520 KB Output is correct
2 Correct 18 ms 82388 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 19 ms 82524 KB Output is correct
6 Correct 18 ms 82524 KB Output is correct
7 Correct 18 ms 82524 KB Output is correct
8 Correct 18 ms 82520 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 19 ms 82520 KB Output is correct
11 Correct 21 ms 82524 KB Output is correct
12 Correct 23 ms 83288 KB Output is correct
13 Correct 24 ms 83472 KB Output is correct
14 Correct 23 ms 83288 KB Output is correct
15 Correct 23 ms 83292 KB Output is correct
16 Correct 22 ms 83292 KB Output is correct
17 Correct 22 ms 83292 KB Output is correct
18 Correct 22 ms 83292 KB Output is correct
19 Correct 362 ms 117864 KB Output is correct
20 Correct 345 ms 118088 KB Output is correct
21 Correct 293 ms 117892 KB Output is correct
22 Correct 284 ms 118068 KB Output is correct
23 Correct 316 ms 118068 KB Output is correct
24 Correct 225 ms 117956 KB Output is correct
25 Correct 213 ms 118004 KB Output is correct
26 Correct 243 ms 117884 KB Output is correct
27 Correct 251 ms 117864 KB Output is correct
28 Correct 263 ms 117776 KB Output is correct
29 Correct 264 ms 118212 KB Output is correct
30 Correct 285 ms 117824 KB Output is correct
31 Correct 273 ms 117832 KB Output is correct
32 Correct 256 ms 117952 KB Output is correct
33 Correct 264 ms 117828 KB Output is correct
34 Correct 244 ms 118064 KB Output is correct
35 Correct 210 ms 118064 KB Output is correct
36 Correct 210 ms 118068 KB Output is correct
37 Correct 210 ms 118064 KB Output is correct
38 Correct 213 ms 118064 KB Output is correct
39 Correct 995 ms 118128 KB Output is correct
40 Correct 1598 ms 117884 KB Output is correct
41 Correct 1186 ms 118324 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 82520 KB Output is correct
2 Correct 18 ms 82388 KB Output is correct
3 Correct 18 ms 82524 KB Output is correct
4 Correct 18 ms 82524 KB Output is correct
5 Correct 19 ms 82524 KB Output is correct
6 Correct 18 ms 82524 KB Output is correct
7 Correct 18 ms 82524 KB Output is correct
8 Correct 18 ms 82520 KB Output is correct
9 Correct 18 ms 82524 KB Output is correct
10 Correct 19 ms 82520 KB Output is correct
11 Correct 21 ms 82524 KB Output is correct
12 Correct 23 ms 83288 KB Output is correct
13 Correct 24 ms 83472 KB Output is correct
14 Correct 23 ms 83288 KB Output is correct
15 Correct 23 ms 83292 KB Output is correct
16 Correct 22 ms 83292 KB Output is correct
17 Correct 22 ms 83292 KB Output is correct
18 Correct 22 ms 83292 KB Output is correct
19 Correct 2155 ms 234124 KB Output is correct
20 Correct 1999 ms 233996 KB Output is correct
21 Correct 2061 ms 233996 KB Output is correct
22 Correct 2041 ms 234000 KB Output is correct
23 Correct 1379 ms 233960 KB Output is correct
24 Correct 173 ms 99612 KB Output is correct
25 Correct 157 ms 99652 KB Output is correct
26 Correct 112 ms 99648 KB Output is correct
27 Correct 114 ms 99648 KB Output is correct
28 Correct 114 ms 99552 KB Output is correct
29 Correct 112 ms 99688 KB Output is correct
30 Correct 99 ms 99748 KB Output is correct
31 Correct 323 ms 99652 KB Output is correct
32 Correct 54 ms 83188 KB Output is correct
33 Correct 336 ms 99736 KB Output is correct
34 Correct 362 ms 117864 KB Output is correct
35 Correct 345 ms 118088 KB Output is correct
36 Correct 293 ms 117892 KB Output is correct
37 Correct 284 ms 118068 KB Output is correct
38 Correct 316 ms 118068 KB Output is correct
39 Correct 225 ms 117956 KB Output is correct
40 Correct 213 ms 118004 KB Output is correct
41 Correct 243 ms 117884 KB Output is correct
42 Correct 251 ms 117864 KB Output is correct
43 Correct 263 ms 117776 KB Output is correct
44 Correct 264 ms 118212 KB Output is correct
45 Correct 285 ms 117824 KB Output is correct
46 Correct 273 ms 117832 KB Output is correct
47 Correct 256 ms 117952 KB Output is correct
48 Correct 264 ms 117828 KB Output is correct
49 Correct 244 ms 118064 KB Output is correct
50 Correct 210 ms 118064 KB Output is correct
51 Correct 210 ms 118068 KB Output is correct
52 Correct 210 ms 118064 KB Output is correct
53 Correct 213 ms 118064 KB Output is correct
54 Correct 995 ms 118128 KB Output is correct
55 Correct 1598 ms 117884 KB Output is correct
56 Correct 1186 ms 118324 KB Output is correct
57 Correct 2107 ms 233832 KB Output is correct
58 Correct 2346 ms 234096 KB Output is correct
59 Correct 2266 ms 234148 KB Output is correct
60 Correct 2084 ms 234196 KB Output is correct
61 Correct 2161 ms 234436 KB Output is correct
62 Correct 2176 ms 234072 KB Output is correct
63 Correct 1085 ms 234124 KB Output is correct
64 Correct 1069 ms 234392 KB Output is correct
65 Correct 1459 ms 234084 KB Output is correct
66 Correct 1480 ms 234024 KB Output is correct
67 Correct 1461 ms 234312 KB Output is correct
68 Correct 1483 ms 233996 KB Output is correct
69 Correct 1468 ms 233924 KB Output is correct
70 Correct 1449 ms 234132 KB Output is correct
71 Correct 1463 ms 234084 KB Output is correct
72 Correct 1438 ms 233844 KB Output is correct
73 Correct 1046 ms 233936 KB Output is correct
74 Correct 1080 ms 233952 KB Output is correct
75 Correct 1067 ms 234356 KB Output is correct
76 Correct 1077 ms 234196 KB Output is correct
77 Correct 1070 ms 233908 KB Output is correct
78 Execution timed out 3057 ms 234000 KB Time limit exceeded
79 Halted 0 ms 0 KB -