oj.uz

답안 #894277

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894277 2023-12-28T03:27:27 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 234524 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 (int mn, int mx) {
        this->mx = mx, this->mn = mn, this->val = 0;
    }
};
struct SegmentTree {
    vector<Node> vec;
    vector<int> nodes;
    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, *(--lower_bound(right.v.begin(), right.v.end(), left.mx)) + 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(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;
        int n = nodes.size();
        n = (1 << (int)log2(n)) * 2;
        vec.assign(2 * n, Node(INT_MAX, -INT_MAX));
        this->nodes.reserve(vec.size());
        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:54:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |         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 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 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 696 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 6 ms 2140 KB Output is correct
14 Correct 6 ms 1880 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 1884 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2381 ms 234140 KB Output is correct
2 Correct 2310 ms 233940 KB Output is correct
3 Correct 2364 ms 233936 KB Output is correct
4 Correct 2366 ms 234476 KB Output is correct
5 Correct 1540 ms 234196 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 27852 KB Output is correct
2 Correct 160 ms 27968 KB Output is correct
3 Correct 110 ms 27968 KB Output is correct
4 Correct 107 ms 27856 KB Output is correct
5 Correct 107 ms 27848 KB Output is correct
6 Correct 97 ms 27952 KB Output is correct
7 Correct 95 ms 27860 KB Output is correct
8 Correct 306 ms 27960 KB Output is correct
9 Correct 38 ms 816 KB Output is correct
10 Correct 316 ms 28368 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 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 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 696 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 6 ms 2140 KB Output is correct
14 Correct 6 ms 1880 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 1884 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 360 ms 56384 KB Output is correct
20 Correct 360 ms 56392 KB Output is correct
21 Correct 296 ms 56468 KB Output is correct
22 Correct 288 ms 56428 KB Output is correct
23 Correct 298 ms 56480 KB Output is correct
24 Correct 220 ms 56632 KB Output is correct
25 Correct 216 ms 56428 KB Output is correct
26 Correct 242 ms 56388 KB Output is correct
27 Correct 243 ms 56384 KB Output is correct
28 Correct 250 ms 56368 KB Output is correct
29 Correct 264 ms 56520 KB Output is correct
30 Correct 250 ms 56384 KB Output is correct
31 Correct 273 ms 56384 KB Output is correct
32 Correct 251 ms 56388 KB Output is correct
33 Correct 258 ms 56384 KB Output is correct
34 Correct 217 ms 56404 KB Output is correct
35 Correct 210 ms 56384 KB Output is correct
36 Correct 210 ms 56384 KB Output is correct
37 Correct 209 ms 56496 KB Output is correct
38 Correct 211 ms 56512 KB Output is correct
39 Correct 965 ms 56704 KB Output is correct
40 Correct 1530 ms 56412 KB Output is correct
41 Correct 1145 ms 56776 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 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 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 696 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 6 ms 2140 KB Output is correct
14 Correct 6 ms 1880 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 1884 KB Output is correct
18 Correct 5 ms 1884 KB Output is correct
19 Correct 2381 ms 234140 KB Output is correct
20 Correct 2310 ms 233940 KB Output is correct
21 Correct 2364 ms 233936 KB Output is correct
22 Correct 2366 ms 234476 KB Output is correct
23 Correct 1540 ms 234196 KB Output is correct
24 Correct 158 ms 27852 KB Output is correct
25 Correct 160 ms 27968 KB Output is correct
26 Correct 110 ms 27968 KB Output is correct
27 Correct 107 ms 27856 KB Output is correct
28 Correct 107 ms 27848 KB Output is correct
29 Correct 97 ms 27952 KB Output is correct
30 Correct 95 ms 27860 KB Output is correct
31 Correct 306 ms 27960 KB Output is correct
32 Correct 38 ms 816 KB Output is correct
33 Correct 316 ms 28368 KB Output is correct
34 Correct 360 ms 56384 KB Output is correct
35 Correct 360 ms 56392 KB Output is correct
36 Correct 296 ms 56468 KB Output is correct
37 Correct 288 ms 56428 KB Output is correct
38 Correct 298 ms 56480 KB Output is correct
39 Correct 220 ms 56632 KB Output is correct
40 Correct 216 ms 56428 KB Output is correct
41 Correct 242 ms 56388 KB Output is correct
42 Correct 243 ms 56384 KB Output is correct
43 Correct 250 ms 56368 KB Output is correct
44 Correct 264 ms 56520 KB Output is correct
45 Correct 250 ms 56384 KB Output is correct
46 Correct 273 ms 56384 KB Output is correct
47 Correct 251 ms 56388 KB Output is correct
48 Correct 258 ms 56384 KB Output is correct
49 Correct 217 ms 56404 KB Output is correct
50 Correct 210 ms 56384 KB Output is correct
51 Correct 210 ms 56384 KB Output is correct
52 Correct 209 ms 56496 KB Output is correct
53 Correct 211 ms 56512 KB Output is correct
54 Correct 965 ms 56704 KB Output is correct
55 Correct 1530 ms 56412 KB Output is correct
56 Correct 1145 ms 56776 KB Output is correct
57 Correct 2372 ms 234184 KB Output is correct
58 Correct 2369 ms 233996 KB Output is correct
59 Correct 2263 ms 234156 KB Output is correct
60 Correct 2184 ms 234228 KB Output is correct
61 Correct 2219 ms 234524 KB Output is correct
62 Correct 2284 ms 234100 KB Output is correct
63 Correct 1131 ms 234124 KB Output is correct
64 Correct 1138 ms 234216 KB Output is correct
65 Correct 1482 ms 234464 KB Output is correct
66 Correct 1477 ms 234308 KB Output is correct
67 Correct 1523 ms 234104 KB Output is correct
68 Correct 1482 ms 234172 KB Output is correct
69 Correct 1491 ms 233920 KB Output is correct
70 Correct 1481 ms 234236 KB Output is correct
71 Correct 1489 ms 234392 KB Output is correct
72 Correct 1535 ms 233996 KB Output is correct
73 Correct 1136 ms 233996 KB Output is correct
74 Correct 1157 ms 234152 KB Output is correct
75 Correct 1137 ms 234108 KB Output is correct
76 Correct 1140 ms 234156 KB Output is correct
77 Correct 1149 ms 234108 KB Output is correct
78 Execution timed out 3036 ms 233960 KB Time limit exceeded
79 Halted 0 ms 0 KB -