oj.uz

답안 #894295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894295 2023-12-28T04:08:23 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 238356 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;
    }
    int query (int l, int r) {
        r += 1;
        vector<int> vec1, vec2;
        int ql = l, qr = r, sz = (int)vec.size()/2;
        for(ql += sz , qr += sz; ql < qr;ql >>= 1 , qr >>= 1){
            if(ql&1){
                vec1.push_back(ql++);
            }
            if(qr&1){
                vec2.push_back(--qr);
            }
        }
        reverse(vec2.begin(), vec2.end());
        for (int x: vec2) vec1.push_back(x);
        Node ans = vec[vec1[0]];
        for (int i = 1; i < vec1.size(); i++) {
            ans = merge(ans, vec[vec1[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:47:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for (int i = 1; i < vec1.size(); i++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 420 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 344 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 7 ms 1880 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 7 ms 2092 KB Output is correct
16 Correct 6 ms 1880 KB Output is correct
17 Correct 7 ms 2136 KB Output is correct
18 Correct 8 ms 2072 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2424 ms 237964 KB Output is correct
2 Correct 2345 ms 238192 KB Output is correct
3 Correct 2463 ms 238112 KB Output is correct
4 Correct 2314 ms 238024 KB Output is correct
5 Correct 1639 ms 238012 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 183 ms 28252 KB Output is correct
2 Correct 151 ms 28372 KB Output is correct
3 Correct 177 ms 28364 KB Output is correct
4 Correct 139 ms 28508 KB Output is correct
5 Correct 135 ms 28368 KB Output is correct
6 Correct 122 ms 28280 KB Output is correct
7 Correct 117 ms 28368 KB Output is correct
8 Correct 380 ms 28364 KB Output is correct
9 Correct 44 ms 772 KB Output is correct
10 Correct 347 ms 28372 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 420 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 344 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 7 ms 1880 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 7 ms 2092 KB Output is correct
16 Correct 6 ms 1880 KB Output is correct
17 Correct 7 ms 2136 KB Output is correct
18 Correct 8 ms 2072 KB Output is correct
19 Correct 387 ms 57364 KB Output is correct
20 Correct 419 ms 57408 KB Output is correct
21 Correct 319 ms 57352 KB Output is correct
22 Correct 340 ms 57412 KB Output is correct
23 Correct 388 ms 57192 KB Output is correct
24 Correct 243 ms 57336 KB Output is correct
25 Correct 238 ms 57412 KB Output is correct
26 Correct 305 ms 57272 KB Output is correct
27 Correct 296 ms 57368 KB Output is correct
28 Correct 311 ms 57308 KB Output is correct
29 Correct 348 ms 57388 KB Output is correct
30 Correct 321 ms 57192 KB Output is correct
31 Correct 306 ms 57292 KB Output is correct
32 Correct 304 ms 57300 KB Output is correct
33 Correct 314 ms 57376 KB Output is correct
34 Correct 241 ms 57412 KB Output is correct
35 Correct 254 ms 57348 KB Output is correct
36 Correct 234 ms 57408 KB Output is correct
37 Correct 243 ms 57412 KB Output is correct
38 Correct 228 ms 57320 KB Output is correct
39 Correct 1006 ms 57216 KB Output is correct
40 Correct 1654 ms 57168 KB Output is correct
41 Correct 1237 ms 57544 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 1 ms 420 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 344 KB Output is correct
11 Correct 3 ms 856 KB Output is correct
12 Correct 7 ms 1880 KB Output is correct
13 Correct 5 ms 1884 KB Output is correct
14 Correct 7 ms 1884 KB Output is correct
15 Correct 7 ms 2092 KB Output is correct
16 Correct 6 ms 1880 KB Output is correct
17 Correct 7 ms 2136 KB Output is correct
18 Correct 8 ms 2072 KB Output is correct
19 Correct 2424 ms 237964 KB Output is correct
20 Correct 2345 ms 238192 KB Output is correct
21 Correct 2463 ms 238112 KB Output is correct
22 Correct 2314 ms 238024 KB Output is correct
23 Correct 1639 ms 238012 KB Output is correct
24 Correct 183 ms 28252 KB Output is correct
25 Correct 151 ms 28372 KB Output is correct
26 Correct 177 ms 28364 KB Output is correct
27 Correct 139 ms 28508 KB Output is correct
28 Correct 135 ms 28368 KB Output is correct
29 Correct 122 ms 28280 KB Output is correct
30 Correct 117 ms 28368 KB Output is correct
31 Correct 380 ms 28364 KB Output is correct
32 Correct 44 ms 772 KB Output is correct
33 Correct 347 ms 28372 KB Output is correct
34 Correct 387 ms 57364 KB Output is correct
35 Correct 419 ms 57408 KB Output is correct
36 Correct 319 ms 57352 KB Output is correct
37 Correct 340 ms 57412 KB Output is correct
38 Correct 388 ms 57192 KB Output is correct
39 Correct 243 ms 57336 KB Output is correct
40 Correct 238 ms 57412 KB Output is correct
41 Correct 305 ms 57272 KB Output is correct
42 Correct 296 ms 57368 KB Output is correct
43 Correct 311 ms 57308 KB Output is correct
44 Correct 348 ms 57388 KB Output is correct
45 Correct 321 ms 57192 KB Output is correct
46 Correct 306 ms 57292 KB Output is correct
47 Correct 304 ms 57300 KB Output is correct
48 Correct 314 ms 57376 KB Output is correct
49 Correct 241 ms 57412 KB Output is correct
50 Correct 254 ms 57348 KB Output is correct
51 Correct 234 ms 57408 KB Output is correct
52 Correct 243 ms 57412 KB Output is correct
53 Correct 228 ms 57320 KB Output is correct
54 Correct 1006 ms 57216 KB Output is correct
55 Correct 1654 ms 57168 KB Output is correct
56 Correct 1237 ms 57544 KB Output is correct
57 Correct 2467 ms 238016 KB Output is correct
58 Correct 2496 ms 237876 KB Output is correct
59 Correct 2350 ms 238040 KB Output is correct
60 Correct 2343 ms 237952 KB Output is correct
61 Correct 2202 ms 237952 KB Output is correct
62 Correct 2255 ms 238012 KB Output is correct
63 Correct 1180 ms 238092 KB Output is correct
64 Correct 1187 ms 237904 KB Output is correct
65 Correct 1556 ms 238092 KB Output is correct
66 Correct 1571 ms 238096 KB Output is correct
67 Correct 1604 ms 237924 KB Output is correct
68 Correct 1559 ms 238356 KB Output is correct
69 Correct 1626 ms 238016 KB Output is correct
70 Correct 1559 ms 238036 KB Output is correct
71 Correct 1570 ms 237928 KB Output is correct
72 Correct 1606 ms 238032 KB Output is correct
73 Correct 1182 ms 237888 KB Output is correct
74 Correct 1195 ms 238092 KB Output is correct
75 Correct 1198 ms 238032 KB Output is correct
76 Correct 1201 ms 238096 KB Output is correct
77 Correct 1244 ms 238032 KB Output is correct
78 Execution timed out 3043 ms 238028 KB Time limit exceeded
79 Halted 0 ms 0 KB -