oj.uz

답안 #894226

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894226 2023-12-28T02:59:03 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 253940 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);
        } 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();
            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]);
        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());
        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:56:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         for (int i = 1; i < intervals.size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 452 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 348 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 452 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 348 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 6 ms 2396 KB Output is correct
13 Correct 4 ms 2140 KB Output is correct
14 Correct 6 ms 2140 KB Output is correct
15 Correct 6 ms 2140 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 4 ms 2140 KB Output is correct
18 Correct 5 ms 2100 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1995 ms 253940 KB Output is correct
2 Correct 1938 ms 251876 KB Output is correct
3 Correct 1995 ms 251064 KB Output is correct
4 Correct 1972 ms 253200 KB Output is correct
5 Correct 1304 ms 251460 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 151 ms 29232 KB Output is correct
2 Correct 135 ms 29116 KB Output is correct
3 Correct 107 ms 29264 KB Output is correct
4 Correct 98 ms 28980 KB Output is correct
5 Correct 96 ms 28980 KB Output is correct
6 Correct 85 ms 29232 KB Output is correct
7 Correct 84 ms 29208 KB Output is correct
8 Correct 303 ms 29096 KB Output is correct
9 Correct 43 ms 1812 KB Output is correct
10 Correct 297 ms 29204 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 452 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 348 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 6 ms 2396 KB Output is correct
13 Correct 4 ms 2140 KB Output is correct
14 Correct 6 ms 2140 KB Output is correct
15 Correct 6 ms 2140 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 4 ms 2140 KB Output is correct
18 Correct 5 ms 2100 KB Output is correct
19 Correct 315 ms 60276 KB Output is correct
20 Correct 327 ms 60952 KB Output is correct
21 Correct 267 ms 60188 KB Output is correct
22 Correct 263 ms 60184 KB Output is correct
23 Correct 273 ms 61044 KB Output is correct
24 Correct 206 ms 59892 KB Output is correct
25 Correct 198 ms 60144 KB Output is correct
26 Correct 229 ms 60216 KB Output is correct
27 Correct 222 ms 60300 KB Output is correct
28 Correct 241 ms 60208 KB Output is correct
29 Correct 234 ms 60368 KB Output is correct
30 Correct 237 ms 61548 KB Output is correct
31 Correct 234 ms 60772 KB Output is correct
32 Correct 240 ms 60784 KB Output is correct
33 Correct 235 ms 60696 KB Output is correct
34 Correct 184 ms 60100 KB Output is correct
35 Correct 193 ms 60924 KB Output is correct
36 Correct 184 ms 59620 KB Output is correct
37 Correct 182 ms 59788 KB Output is correct
38 Correct 184 ms 60544 KB Output is correct
39 Correct 920 ms 59816 KB Output is correct
40 Correct 1568 ms 59312 KB Output is correct
41 Correct 1129 ms 59428 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 452 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 348 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 6 ms 2396 KB Output is correct
13 Correct 4 ms 2140 KB Output is correct
14 Correct 6 ms 2140 KB Output is correct
15 Correct 6 ms 2140 KB Output is correct
16 Correct 5 ms 2140 KB Output is correct
17 Correct 4 ms 2140 KB Output is correct
18 Correct 5 ms 2100 KB Output is correct
19 Correct 1995 ms 253940 KB Output is correct
20 Correct 1938 ms 251876 KB Output is correct
21 Correct 1995 ms 251064 KB Output is correct
22 Correct 1972 ms 253200 KB Output is correct
23 Correct 1304 ms 251460 KB Output is correct
24 Correct 151 ms 29232 KB Output is correct
25 Correct 135 ms 29116 KB Output is correct
26 Correct 107 ms 29264 KB Output is correct
27 Correct 98 ms 28980 KB Output is correct
28 Correct 96 ms 28980 KB Output is correct
29 Correct 85 ms 29232 KB Output is correct
30 Correct 84 ms 29208 KB Output is correct
31 Correct 303 ms 29096 KB Output is correct
32 Correct 43 ms 1812 KB Output is correct
33 Correct 297 ms 29204 KB Output is correct
34 Correct 315 ms 60276 KB Output is correct
35 Correct 327 ms 60952 KB Output is correct
36 Correct 267 ms 60188 KB Output is correct
37 Correct 263 ms 60184 KB Output is correct
38 Correct 273 ms 61044 KB Output is correct
39 Correct 206 ms 59892 KB Output is correct
40 Correct 198 ms 60144 KB Output is correct
41 Correct 229 ms 60216 KB Output is correct
42 Correct 222 ms 60300 KB Output is correct
43 Correct 241 ms 60208 KB Output is correct
44 Correct 234 ms 60368 KB Output is correct
45 Correct 237 ms 61548 KB Output is correct
46 Correct 234 ms 60772 KB Output is correct
47 Correct 240 ms 60784 KB Output is correct
48 Correct 235 ms 60696 KB Output is correct
49 Correct 184 ms 60100 KB Output is correct
50 Correct 193 ms 60924 KB Output is correct
51 Correct 184 ms 59620 KB Output is correct
52 Correct 182 ms 59788 KB Output is correct
53 Correct 184 ms 60544 KB Output is correct
54 Correct 920 ms 59816 KB Output is correct
55 Correct 1568 ms 59312 KB Output is correct
56 Correct 1129 ms 59428 KB Output is correct
57 Correct 1942 ms 251340 KB Output is correct
58 Correct 1949 ms 251400 KB Output is correct
59 Correct 1901 ms 253120 KB Output is correct
60 Correct 1887 ms 251920 KB Output is correct
61 Correct 1901 ms 251596 KB Output is correct
62 Correct 1894 ms 253004 KB Output is correct
63 Correct 931 ms 251956 KB Output is correct
64 Correct 939 ms 250664 KB Output is correct
65 Correct 1287 ms 251740 KB Output is correct
66 Correct 1292 ms 251588 KB Output is correct
67 Correct 1282 ms 252384 KB Output is correct
68 Correct 1320 ms 251176 KB Output is correct
69 Correct 1298 ms 252196 KB Output is correct
70 Correct 1303 ms 252928 KB Output is correct
71 Correct 1298 ms 251472 KB Output is correct
72 Correct 1319 ms 250448 KB Output is correct
73 Correct 980 ms 250684 KB Output is correct
74 Correct 983 ms 251904 KB Output is correct
75 Correct 980 ms 250348 KB Output is correct
76 Correct 957 ms 251952 KB Output is correct
77 Correct 971 ms 251508 KB Output is correct
78 Execution timed out 3041 ms 239572 KB Time limit exceeded
79 Halted 0 ms 0 KB -