oj.uz

답안 #894288

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894288 2023-12-28T03:51:24 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 238236 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) {
            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, tl, (tl + tr)/2,l, r), query(2 * dum + 1, (tl + tr)/2 + 1, tr, l, r);
        }
    }
    int query (int l, int r) {
        intervals.clear();
        query(1, 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, tl, (tl + tr)/2), build(2 * dum + 1, (tl + tr)/2 + 1, tr);
            vec[dum] = merge(vec[2 * dum], vec[2 * dum + 1]);
            std::merge(vec[2 * dum].v.begin(), vec[2 * dum].v.end(),
                       vec[2 * dum + 1].v.begin(), vec[2 * dum + 1].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( 1, 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:44:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 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 1 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 344 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 856 KB Output is correct
12 Correct 5 ms 2140 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 6 ms 2240 KB Output is correct
15 Correct 6 ms 2200 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 5 ms 2180 KB Output is correct
18 Correct 6 ms 2008 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2021 ms 238036 KB Output is correct
2 Correct 1984 ms 238180 KB Output is correct
3 Correct 2047 ms 238232 KB Output is correct
4 Correct 2036 ms 237972 KB Output is correct
5 Correct 1373 ms 238048 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 145 ms 28360 KB Output is correct
2 Correct 133 ms 28364 KB Output is correct
3 Correct 110 ms 28372 KB Output is correct
4 Correct 104 ms 28360 KB Output is correct
5 Correct 110 ms 28372 KB Output is correct
6 Correct 90 ms 28360 KB Output is correct
7 Correct 89 ms 28360 KB Output is correct
8 Correct 309 ms 28372 KB Output is correct
9 Correct 39 ms 604 KB Output is correct
10 Correct 310 ms 28344 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 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 856 KB Output is correct
12 Correct 5 ms 2140 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 6 ms 2240 KB Output is correct
15 Correct 6 ms 2200 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 5 ms 2180 KB Output is correct
18 Correct 6 ms 2008 KB Output is correct
19 Correct 342 ms 57236 KB Output is correct
20 Correct 332 ms 57384 KB Output is correct
21 Correct 270 ms 57412 KB Output is correct
22 Correct 264 ms 57408 KB Output is correct
23 Correct 279 ms 57324 KB Output is correct
24 Correct 202 ms 57548 KB Output is correct
25 Correct 203 ms 57412 KB Output is correct
26 Correct 233 ms 57412 KB Output is correct
27 Correct 229 ms 57408 KB Output is correct
28 Correct 246 ms 57408 KB Output is correct
29 Correct 259 ms 57408 KB Output is correct
30 Correct 246 ms 57408 KB Output is correct
31 Correct 267 ms 57276 KB Output is correct
32 Correct 244 ms 57284 KB Output is correct
33 Correct 261 ms 57408 KB Output is correct
34 Correct 196 ms 57408 KB Output is correct
35 Correct 197 ms 57332 KB Output is correct
36 Correct 199 ms 57248 KB Output is correct
37 Correct 202 ms 57264 KB Output is correct
38 Correct 197 ms 57412 KB Output is correct
39 Correct 895 ms 57456 KB Output is correct
40 Correct 1547 ms 57100 KB Output is correct
41 Correct 1143 ms 57412 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 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 856 KB Output is correct
12 Correct 5 ms 2140 KB Output is correct
13 Correct 5 ms 2140 KB Output is correct
14 Correct 6 ms 2240 KB Output is correct
15 Correct 6 ms 2200 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 5 ms 2180 KB Output is correct
18 Correct 6 ms 2008 KB Output is correct
19 Correct 2021 ms 238036 KB Output is correct
20 Correct 1984 ms 238180 KB Output is correct
21 Correct 2047 ms 238232 KB Output is correct
22 Correct 2036 ms 237972 KB Output is correct
23 Correct 1373 ms 238048 KB Output is correct
24 Correct 145 ms 28360 KB Output is correct
25 Correct 133 ms 28364 KB Output is correct
26 Correct 110 ms 28372 KB Output is correct
27 Correct 104 ms 28360 KB Output is correct
28 Correct 110 ms 28372 KB Output is correct
29 Correct 90 ms 28360 KB Output is correct
30 Correct 89 ms 28360 KB Output is correct
31 Correct 309 ms 28372 KB Output is correct
32 Correct 39 ms 604 KB Output is correct
33 Correct 310 ms 28344 KB Output is correct
34 Correct 342 ms 57236 KB Output is correct
35 Correct 332 ms 57384 KB Output is correct
36 Correct 270 ms 57412 KB Output is correct
37 Correct 264 ms 57408 KB Output is correct
38 Correct 279 ms 57324 KB Output is correct
39 Correct 202 ms 57548 KB Output is correct
40 Correct 203 ms 57412 KB Output is correct
41 Correct 233 ms 57412 KB Output is correct
42 Correct 229 ms 57408 KB Output is correct
43 Correct 246 ms 57408 KB Output is correct
44 Correct 259 ms 57408 KB Output is correct
45 Correct 246 ms 57408 KB Output is correct
46 Correct 267 ms 57276 KB Output is correct
47 Correct 244 ms 57284 KB Output is correct
48 Correct 261 ms 57408 KB Output is correct
49 Correct 196 ms 57408 KB Output is correct
50 Correct 197 ms 57332 KB Output is correct
51 Correct 199 ms 57248 KB Output is correct
52 Correct 202 ms 57264 KB Output is correct
53 Correct 197 ms 57412 KB Output is correct
54 Correct 895 ms 57456 KB Output is correct
55 Correct 1547 ms 57100 KB Output is correct
56 Correct 1143 ms 57412 KB Output is correct
57 Correct 2013 ms 238092 KB Output is correct
58 Correct 1994 ms 238096 KB Output is correct
59 Correct 1955 ms 238072 KB Output is correct
60 Correct 1903 ms 238092 KB Output is correct
61 Correct 1953 ms 237892 KB Output is correct
62 Correct 2041 ms 238092 KB Output is correct
63 Correct 1002 ms 238096 KB Output is correct
64 Correct 1016 ms 238024 KB Output is correct
65 Correct 1356 ms 238124 KB Output is correct
66 Correct 1358 ms 238092 KB Output is correct
67 Correct 1363 ms 238092 KB Output is correct
68 Correct 1364 ms 238108 KB Output is correct
69 Correct 1358 ms 238120 KB Output is correct
70 Correct 1429 ms 238236 KB Output is correct
71 Correct 1365 ms 237980 KB Output is correct
72 Correct 1365 ms 238012 KB Output is correct
73 Correct 1004 ms 238072 KB Output is correct
74 Correct 1018 ms 238008 KB Output is correct
75 Correct 1002 ms 238096 KB Output is correct
76 Correct 1008 ms 238096 KB Output is correct
77 Correct 1031 ms 238096 KB Output is correct
78 Execution timed out 3067 ms 238016 KB Time limit exceeded
79 Halted 0 ms 0 KB -