oj.uz

답안 #894296

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894296 2023-12-28T04:09:53 Z Olympia Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
77 / 100
 3000 ms 238216 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;
    int sz;
    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;
        for(l += sz , r += sz; l < r;l >>= 1 , r >>= 1){
            if(l&1){
                vec1.push_back(l++);
            }
            if(r&1){
                vec2.push_back(--r);
            }
        }
        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;
        this->sz = n;
        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 0 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 0 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 344 KB Output is correct
8 Correct 1 ms 600 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 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 0 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 7 ms 1952 KB Output is correct
14 Correct 7 ms 1880 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 2080 KB Output is correct
17 Correct 5 ms 1880 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2195 ms 238020 KB Output is correct
2 Correct 2231 ms 237988 KB Output is correct
3 Correct 2286 ms 238140 KB Output is correct
4 Correct 2246 ms 237940 KB Output is correct
5 Correct 1604 ms 238024 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 28364 KB Output is correct
2 Correct 156 ms 28372 KB Output is correct
3 Correct 125 ms 28644 KB Output is correct
4 Correct 127 ms 28360 KB Output is correct
5 Correct 127 ms 28360 KB Output is correct
6 Correct 125 ms 28404 KB Output is correct
7 Correct 106 ms 28360 KB Output is correct
8 Correct 331 ms 28360 KB Output is correct
9 Correct 49 ms 860 KB Output is correct
10 Correct 334 ms 28372 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 7 ms 1952 KB Output is correct
14 Correct 7 ms 1880 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 2080 KB Output is correct
17 Correct 5 ms 1880 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct
19 Correct 418 ms 57336 KB Output is correct
20 Correct 368 ms 57300 KB Output is correct
21 Correct 323 ms 57296 KB Output is correct
22 Correct 335 ms 57412 KB Output is correct
23 Correct 327 ms 57408 KB Output is correct
24 Correct 242 ms 57412 KB Output is correct
25 Correct 235 ms 57388 KB Output is correct
26 Correct 291 ms 57452 KB Output is correct
27 Correct 266 ms 57412 KB Output is correct
28 Correct 304 ms 57400 KB Output is correct
29 Correct 281 ms 57392 KB Output is correct
30 Correct 279 ms 57412 KB Output is correct
31 Correct 291 ms 57280 KB Output is correct
32 Correct 284 ms 57296 KB Output is correct
33 Correct 293 ms 57408 KB Output is correct
34 Correct 227 ms 57348 KB Output is correct
35 Correct 242 ms 57412 KB Output is correct
36 Correct 227 ms 57380 KB Output is correct
37 Correct 234 ms 57244 KB Output is correct
38 Correct 236 ms 57396 KB Output is correct
39 Correct 959 ms 57312 KB Output is correct
40 Correct 1555 ms 56756 KB Output is correct
41 Correct 1185 ms 57296 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 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 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 5 ms 1884 KB Output is correct
13 Correct 7 ms 1952 KB Output is correct
14 Correct 7 ms 1880 KB Output is correct
15 Correct 7 ms 1884 KB Output is correct
16 Correct 6 ms 2080 KB Output is correct
17 Correct 5 ms 1880 KB Output is correct
18 Correct 6 ms 1884 KB Output is correct
19 Correct 2195 ms 238020 KB Output is correct
20 Correct 2231 ms 237988 KB Output is correct
21 Correct 2286 ms 238140 KB Output is correct
22 Correct 2246 ms 237940 KB Output is correct
23 Correct 1604 ms 238024 KB Output is correct
24 Correct 159 ms 28364 KB Output is correct
25 Correct 156 ms 28372 KB Output is correct
26 Correct 125 ms 28644 KB Output is correct
27 Correct 127 ms 28360 KB Output is correct
28 Correct 127 ms 28360 KB Output is correct
29 Correct 125 ms 28404 KB Output is correct
30 Correct 106 ms 28360 KB Output is correct
31 Correct 331 ms 28360 KB Output is correct
32 Correct 49 ms 860 KB Output is correct
33 Correct 334 ms 28372 KB Output is correct
34 Correct 418 ms 57336 KB Output is correct
35 Correct 368 ms 57300 KB Output is correct
36 Correct 323 ms 57296 KB Output is correct
37 Correct 335 ms 57412 KB Output is correct
38 Correct 327 ms 57408 KB Output is correct
39 Correct 242 ms 57412 KB Output is correct
40 Correct 235 ms 57388 KB Output is correct
41 Correct 291 ms 57452 KB Output is correct
42 Correct 266 ms 57412 KB Output is correct
43 Correct 304 ms 57400 KB Output is correct
44 Correct 281 ms 57392 KB Output is correct
45 Correct 279 ms 57412 KB Output is correct
46 Correct 291 ms 57280 KB Output is correct
47 Correct 284 ms 57296 KB Output is correct
48 Correct 293 ms 57408 KB Output is correct
49 Correct 227 ms 57348 KB Output is correct
50 Correct 242 ms 57412 KB Output is correct
51 Correct 227 ms 57380 KB Output is correct
52 Correct 234 ms 57244 KB Output is correct
53 Correct 236 ms 57396 KB Output is correct
54 Correct 959 ms 57312 KB Output is correct
55 Correct 1555 ms 56756 KB Output is correct
56 Correct 1185 ms 57296 KB Output is correct
57 Correct 2230 ms 238108 KB Output is correct
58 Correct 2230 ms 238096 KB Output is correct
59 Correct 2248 ms 238096 KB Output is correct
60 Correct 2149 ms 238024 KB Output is correct
61 Correct 2320 ms 238028 KB Output is correct
62 Correct 2155 ms 238216 KB Output is correct
63 Correct 1171 ms 238036 KB Output is correct
64 Correct 1181 ms 238092 KB Output is correct
65 Correct 1652 ms 238092 KB Output is correct
66 Correct 1635 ms 237904 KB Output is correct
67 Correct 1629 ms 237904 KB Output is correct
68 Correct 1569 ms 238168 KB Output is correct
69 Correct 1640 ms 238096 KB Output is correct
70 Correct 1571 ms 238160 KB Output is correct
71 Correct 1591 ms 238092 KB Output is correct
72 Correct 1653 ms 238092 KB Output is correct
73 Correct 1168 ms 238016 KB Output is correct
74 Correct 1245 ms 238028 KB Output is correct
75 Correct 1230 ms 238032 KB Output is correct
76 Correct 1227 ms 238092 KB Output is correct
77 Correct 1237 ms 237936 KB Output is correct
78 Execution timed out 3034 ms 238092 KB Time limit exceeded
79 Halted 0 ms 0 KB -