oj.uz

Submission #562924

# Submission time Handle Problem Language Result Execution time Memory
562924 2022-05-15T15:43:41 Z Stickfish Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 837 ms 63336 KB 
#include <iostream>
#include <bitset>
#include <random>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
using ush = unsigned short;
 
const ll INF = 1e9 + 177013;
const int MAXN = 1e6 + 123;
const int SHORT = 1 << 16;
int w[MAXN];
int pv[MAXN];
 
int get_max(int l, int r) {
    int mx = -INF;
    int ans = 0;
    for (int i = l; i < r; ++i) {
        if (mx > w[i])
            ans = max(ans, mx + w[i]);
        else
            mx = w[i];
    }
    return ans;
}
 
void merg_add(vector<pair<int, int>>& a, pair<int, int> vl) {
    while (a.size() && a.back().first == vl.first) {
        a.pop_back();
    }
    a.push_back(vl);
}
 

struct bitr {
    void resize(int n) {
        t.resize(n);
    }

    void maxeq(int i, int x) {
        while (i < t.size()) {
            t[i] = max(t[i], x);
            i |= i + 1;
        }
    }

    int getmx(int i) {
        int ans = 0;
        while (i >= 0) {
            ans = max(ans, t[i]);
            i &= i + 1;
            --i;
        }
        return ans;
    }
 private:
     vector<int> t;
};

mt19937 rng(177013);
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; ++i)
        cin >> w[i];
    //while (n < 1000000) {
        //w[n++] = rng() % INF;
    //}
    vector<pair<int, int>> previnit = {{INF, -1}};
    for (int i = 0; i < n; ++i) {
        while (previnit.back().first <= w[i]) {
            previnit.pop_back();
        }
        pv[i] = previnit.back().second;
        previnit.push_back({w[i], i});
    }
    vector<pair<pair<int, int>, pair<int, int>>> qrs(m); 
    for (int i = 0; i < m; ++i) {
        int l, r, k;
        cin >> l >> r >> k;
        --l;
        qrs[i] = {{r, l}, {k, i}};
    }
    sort(qrs.begin(), qrs.end());
    bitset<MAXN> ans;
    bitr tr;
    tr.resize(n);
    int r0 = 0;
    for (auto [sg, msc] : qrs) {
        auto [r, l] = sg;
        auto [k, i] = msc;
        while (r0 < r) {
            if (pv[r0] != -1) {
                //cout << "max equal " << pv[r0] << ' ' << w[r0] + w[pv[r0]] << endl;
                tr.maxeq(n - pv[r0] - 1, w[r0] + w[pv[r0]]);
            }
            ++r0;
        }
        //cout << "get " << l << endl;
        ans[i] = tr.getmx(n - l - 1) <= k;
    }
    for (int i = 0; i < m; ++i)
        cout << ans[i] << '\n';
}

Compilation message

sortbooks.cpp: In member function 'void bitr::maxeq(int, int)':
sortbooks.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |         while (i < t.size()) {
      |                ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 7 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 711 ms 31096 KB Output is correct
2 Correct 699 ms 29948 KB Output is correct
3 Correct 720 ms 29948 KB Output is correct
4 Correct 700 ms 30028 KB Output is correct
5 Correct 705 ms 30016 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 5216 KB Output is correct
2 Correct 61 ms 5228 KB Output is correct
3 Correct 64 ms 5224 KB Output is correct
4 Correct 67 ms 5240 KB Output is correct
5 Correct 58 ms 5240 KB Output is correct
6 Correct 56 ms 5160 KB Output is correct
7 Correct 92 ms 5196 KB Output is correct
8 Correct 55 ms 4996 KB Output is correct
9 Correct 42 ms 3464 KB Output is correct
10 Correct 68 ms 4972 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 7 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 137 ms 8248 KB Output is correct
20 Correct 135 ms 8252 KB Output is correct
21 Correct 185 ms 8164 KB Output is correct
22 Correct 170 ms 8248 KB Output is correct
23 Correct 153 ms 8176 KB Output is correct
24 Correct 146 ms 8164 KB Output is correct
25 Correct 137 ms 8212 KB Output is correct
26 Correct 138 ms 8260 KB Output is correct
27 Correct 153 ms 8228 KB Output is correct
28 Correct 153 ms 8224 KB Output is correct
29 Correct 158 ms 8232 KB Output is correct
30 Correct 132 ms 8152 KB Output is correct
31 Correct 148 ms 8196 KB Output is correct
32 Correct 168 ms 8360 KB Output is correct
33 Correct 136 ms 8260 KB Output is correct
34 Correct 137 ms 8136 KB Output is correct
35 Correct 139 ms 8140 KB Output is correct
36 Correct 158 ms 8172 KB Output is correct
37 Correct 149 ms 8200 KB Output is correct
38 Correct 173 ms 8248 KB Output is correct
39 Correct 129 ms 8184 KB Output is correct
40 Correct 123 ms 7364 KB Output is correct
41 Correct 146 ms 8348 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 5 ms 596 KB Output is correct
12 Correct 3 ms 636 KB Output is correct
13 Correct 3 ms 596 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 7 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 711 ms 31096 KB Output is correct
20 Correct 699 ms 29948 KB Output is correct
21 Correct 720 ms 29948 KB Output is correct
22 Correct 700 ms 30028 KB Output is correct
23 Correct 705 ms 30016 KB Output is correct
24 Correct 84 ms 5216 KB Output is correct
25 Correct 61 ms 5228 KB Output is correct
26 Correct 64 ms 5224 KB Output is correct
27 Correct 67 ms 5240 KB Output is correct
28 Correct 58 ms 5240 KB Output is correct
29 Correct 56 ms 5160 KB Output is correct
30 Correct 92 ms 5196 KB Output is correct
31 Correct 55 ms 4996 KB Output is correct
32 Correct 42 ms 3464 KB Output is correct
33 Correct 68 ms 4972 KB Output is correct
34 Correct 137 ms 8248 KB Output is correct
35 Correct 135 ms 8252 KB Output is correct
36 Correct 185 ms 8164 KB Output is correct
37 Correct 170 ms 8248 KB Output is correct
38 Correct 153 ms 8176 KB Output is correct
39 Correct 146 ms 8164 KB Output is correct
40 Correct 137 ms 8212 KB Output is correct
41 Correct 138 ms 8260 KB Output is correct
42 Correct 153 ms 8228 KB Output is correct
43 Correct 153 ms 8224 KB Output is correct
44 Correct 158 ms 8232 KB Output is correct
45 Correct 132 ms 8152 KB Output is correct
46 Correct 148 ms 8196 KB Output is correct
47 Correct 168 ms 8360 KB Output is correct
48 Correct 136 ms 8260 KB Output is correct
49 Correct 137 ms 8136 KB Output is correct
50 Correct 139 ms 8140 KB Output is correct
51 Correct 158 ms 8172 KB Output is correct
52 Correct 149 ms 8200 KB Output is correct
53 Correct 173 ms 8248 KB Output is correct
54 Correct 129 ms 8184 KB Output is correct
55 Correct 123 ms 7364 KB Output is correct
56 Correct 146 ms 8348 KB Output is correct
57 Correct 702 ms 30044 KB Output is correct
58 Correct 694 ms 30132 KB Output is correct
59 Correct 769 ms 63168 KB Output is correct
60 Correct 778 ms 63268 KB Output is correct
61 Correct 837 ms 63192 KB Output is correct
62 Correct 789 ms 63244 KB Output is correct
63 Correct 710 ms 61308 KB Output is correct
64 Correct 684 ms 61388 KB Output is correct
65 Correct 732 ms 63136 KB Output is correct
66 Correct 705 ms 63212 KB Output is correct
67 Correct 766 ms 63160 KB Output is correct
68 Correct 683 ms 63288 KB Output is correct
69 Correct 723 ms 63336 KB Output is correct
70 Correct 720 ms 63316 KB Output is correct
71 Correct 740 ms 63280 KB Output is correct
72 Correct 694 ms 63332 KB Output is correct
73 Correct 709 ms 59792 KB Output is correct
74 Correct 733 ms 60856 KB Output is correct
75 Correct 734 ms 59964 KB Output is correct
76 Correct 686 ms 59888 KB Output is correct
77 Correct 717 ms 59792 KB Output is correct
78 Correct 683 ms 57224 KB Output is correct
79 Correct 538 ms 46732 KB Output is correct
80 Correct 667 ms 54408 KB Output is correct