oj.uz

Submission #562878

# Submission time Handle Problem Language Result Execution time Memory
562878 2022-05-15T13:04:33 Z Stickfish Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 734 ms 262144 KB 
#include <iostream>
#include <random>
#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);
}
 
vector<pair<int, int>> merg(vector<pair<int, int>> a, vector<pair<int, int>> b) {
    vector<pair<int, int>> ans;
    int n = a.size();
    int m = b.size();
    int j = 0;
    for (int i = 0; i < n; ++i) {
        while (j < m && b[j] < a[i]) {
            merg_add(ans, b[j]);
            ++j;
        }
        merg_add(ans, a[i]);
    }
    while (j < m) {
        merg_add(ans, b[j]);
        ++j;
    }
    int s = ans.size();
    for (int i = s - 2; i >= 0; --i) {
        ans[i].second = max(ans[i].second, ans[i + 1].second);
    }
    return ans;
}
 
struct stree {
    void resize(int n) {
        sz = n;
        t.resize(sz * 2 - 1);
        go_down.resize(sz * 2 - 1);
        t.shrink_to_fit();
        go_down.shrink_to_fit();
        init(0, 0, sz);
    }
 
    int get(int l, int r) {
        return get(0, 0, sz, l, r, lower_bound(t[0].begin(), t[0].end(), pair<int, int>(l, -1)) - t[0].begin());
    }
 
 private:
     int sz;
     vector<vector<pair<int, int>>> t;
     vector<vector<pair<ush, ush>>> go_down;
 
     void init(int ind, int lnd, int rnd) {
         if (rnd - lnd == 1) {
             if (pv[lnd] >= 0)
                 t[ind] = {{pv[lnd], w[lnd] + w[pv[lnd]]}};
         } else {
             int mnd = (lnd + rnd) / 2;
             int chd = ind + (mnd - lnd) * 2;
             init(ind + 1, lnd, mnd);
             init(chd, mnd, rnd);
             t[ind] = merg(t[ind + 1], t[chd]);
             int s = t[ind].size();
             int n = t[ind + 1].size();
             int m = t[chd].size();
             go_down[ind].assign(s, pair<ush, ush>(0, 0));
             int upi = s - 1;
             if (t[ind + 1].size()) {
                 while (upi >= 0 && t[ind][upi].first > t[ind + 1].back().first) {
                     go_down[ind][upi].first = n;
                     --upi;
                 }
                 for (int i = n - 1; i >= 0; --i) {
                     while (upi >= 0 && (i == 0 || t[ind][upi].first > t[ind + 1][i - 1].first)) {
                         go_down[ind][upi].first = i;
                         --upi;
                     }
                 }
             }
             upi = s - 1;
             if (t[chd].size()) {
                 while (upi >= 0 && t[ind][upi].first > t[chd].back().first) {
                     go_down[ind][upi].second = m;
                     --upi;
                 }
                 for (int j = m - 1; j >= 0; --j) {
                     while (upi >= 0 && (j == 0 || t[ind][upi].first > t[chd][j - 1].first)) {
                         go_down[ind][upi].second = j;
                         --upi;
                     }
                 }
             }
             t[ind].shrink_to_fit();
             go_down[ind].shrink_to_fit();
         }
     }
 
     int get(int ind, int lnd, int rnd, int l, int r, int i) {
         //cout << "A" << endl;
         if (i == t[ind].size())
             return 0;
         int mnd = (lnd + rnd) / 2;
         int chd = ind + (mnd - lnd) * 2;
         if (lnd >= l && rnd <= r) {
             return t[ind][i].second;
         }
         if (lnd >= r || rnd <= l)
             return 0;
         int li = go_down[ind][i].first;
         int ri = go_down[ind][i].second;
         while (li < t[ind + 1].size() && t[ind + 1][li].first != t[ind][i].first)
             li += SHORT;
         while (ri < t[chd].size() && t[chd][ri].first != t[ind][i].first)
             ri += SHORT;
         return max(get(ind + 1, lnd, mnd, l, r, go_down[ind][i].first), get(chd, mnd, rnd, l, r, go_down[ind][i].second));
     }
};

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});
    }
    stree tr;
    tr.resize(n);
    for (int i = 0; i < m; ++i) {
        int l, r, k;
        cin >> l >> r >> k;
        --l;
        if (tr.get(l, r) > k) {
            cout << 0 << '\n';
        } else {
            cout << 1 << '\n';
        }
    }
}

Compilation message

sortbooks.cpp: In member function 'int stree::get(int, int, int, int, int, int)':
sortbooks.cpp:122:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |          if (i == t[ind].size())
      |              ~~^~~~~~~~~~~~~~~~
sortbooks.cpp:133:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |          while (li < t[ind + 1].size() && t[ind + 1][li].first != t[ind][i].first)
      |                 ~~~^~~~~~~~~~~~~~~~~~~
sortbooks.cpp:135:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |          while (ri < t[chd].size() && t[chd][ri].first != t[ind][i].first)
      |                 ~~~^~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 6 ms 1620 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 8 ms 1748 KB Output is correct
15 Correct 8 ms 1744 KB Output is correct
16 Correct 4 ms 1236 KB Output is correct
17 Correct 3 ms 980 KB Output is correct
18 Correct 4 ms 1236 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 551 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 28572 KB Output is correct
2 Correct 227 ms 28936 KB Output is correct
3 Correct 50 ms 11248 KB Output is correct
4 Correct 46 ms 11324 KB Output is correct
5 Correct 43 ms 11340 KB Output is correct
6 Correct 50 ms 12240 KB Output is correct
7 Correct 50 ms 12444 KB Output is correct
8 Correct 82 ms 18088 KB Output is correct
9 Correct 30 ms 1344 KB Output is correct
10 Correct 76 ms 16836 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 6 ms 1620 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 8 ms 1748 KB Output is correct
15 Correct 8 ms 1744 KB Output is correct
16 Correct 4 ms 1236 KB Output is correct
17 Correct 3 ms 980 KB Output is correct
18 Correct 4 ms 1236 KB Output is correct
19 Correct 734 ms 59200 KB Output is correct
20 Correct 731 ms 59164 KB Output is correct
21 Correct 413 ms 59196 KB Output is correct
22 Correct 414 ms 59144 KB Output is correct
23 Correct 403 ms 59152 KB Output is correct
24 Correct 102 ms 21812 KB Output is correct
25 Correct 105 ms 21840 KB Output is correct
26 Correct 108 ms 21828 KB Output is correct
27 Correct 109 ms 21840 KB Output is correct
28 Correct 105 ms 21800 KB Output is correct
29 Correct 104 ms 21932 KB Output is correct
30 Correct 105 ms 21812 KB Output is correct
31 Correct 112 ms 21912 KB Output is correct
32 Correct 104 ms 21844 KB Output is correct
33 Correct 112 ms 21820 KB Output is correct
34 Correct 114 ms 21892 KB Output is correct
35 Correct 112 ms 21832 KB Output is correct
36 Correct 108 ms 21740 KB Output is correct
37 Correct 113 ms 21804 KB Output is correct
38 Correct 114 ms 21796 KB Output is correct
39 Correct 206 ms 34044 KB Output is correct
40 Correct 102 ms 17872 KB Output is correct
41 Correct 177 ms 32684 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 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 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 6 ms 1620 KB Output is correct
13 Correct 7 ms 1748 KB Output is correct
14 Correct 8 ms 1748 KB Output is correct
15 Correct 8 ms 1744 KB Output is correct
16 Correct 4 ms 1236 KB Output is correct
17 Correct 3 ms 980 KB Output is correct
18 Correct 4 ms 1236 KB Output is correct
19 Runtime error 551 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -