oj.uz

Submission #909867

# Submission time Handle Problem Language Result Execution time Memory
909867 2024-01-17T14:00:03 Z nima_aryan Triple Jump (JOI19_jumps) C++17
100 / 100
 947 ms 64120 KB 
/**
 *    author:  NimaAryan
 *    created: 2024-01-16 23:23:10  
**/
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#endif

using i64 = long long;

template <class Info, class Tag>
class LazySegmentTree {
 public:
  std::vector<Info> info;
  std::vector<Tag> tag;
  int n;

  LazySegmentTree() : n(0) {}
  LazySegmentTree(int n_, Info v_ = Info()) {
    init(n_, v_);
  }
  LazySegmentTree(std::vector<Info> init_) {
    init(init_);
  }

  void init(int n_, Info v_ = Info()) {
    init(std::vector(n_, v_));
  }
  void init(std::vector<Info> init_) {
    n = (int) init_.size();
    info.assign(4 << std::__lg(n), Info());
    tag.assign(4 << std::__lg(n), Tag());
    std::function<void(int, int, int)> build;
    build = [&](int p, int l, int r) {
      if (r - l == 1) {
        info[p] = init_[l];
        return;
      }
      int m = (l + r) / 2;
      build(2 * p, l, m);
      build(2 * p + 1, m, r);
      pull(p);
    };
    build(1, 0, n);
  }
  void pull(int p) {
    info[p] = info[2 * p] + info[2 * p + 1];
  }
  void apply(int p, const Tag& v) {
    info[p].apply(v);
    tag[p].apply(v);
  }
  void push(int p) {
    apply(2 * p, tag[p]);
    apply(2 * p + 1, tag[p]);
    tag[p] = Tag();
  }
  void modify(int p, int l, int r, int x, const Info& v) {
    if (r - l == 1) {
      info[p] = v;
      return;
    }
    int m = (l + r) / 2;
    push(p);
    if (x < m) {
      modify(2 * p, l, m, x, v);
    } else {
      modify(2 * p + 1, m, r, x, v);
    }
    pull(p);
  }
  void modify(int p, const Info& v) {
    modify(1, 0, n, p, v);
  }

  Info range_query(int p, int l, int r, int lx, int rx) {
    if (l >= rx || r <= lx) {
      return Info();
    }
    if (l >= lx && r <= rx) {
      return info[p];
    }
    int m = (l + r) / 2;
    push(p);
    return range_query(2 * p, l, m, lx, rx) +
           range_query(2 * p + 1, m, r, lx, rx);
  }
  Info range_query(int lx, int rx) {
    return range_query(1, 0, n, lx, rx);
  }
  void range_apply(int p, int l, int r, int lx, int rx,
                  const Tag& v) {
    if (l >= rx || r <= lx) {
      return;
    }
    if (l >= lx && r <= rx) {
      apply(p, v);
      return;
    }
    int m = (l + r) / 2;
    push(p);
    range_apply(2 * p, l, m, lx, rx, v);
    range_apply(2 * p + 1, m, r, lx, rx, v);
    pull(p);
  }
  void range_apply(int lx, int rx, const Tag& v) {
    range_apply(1, 0, n, lx, rx, v);
  }
  template <class F = std::function<bool(const Info&)>>
  int find_first(int p, int l, int r, int lx, int rx,
                 F pred) {
    if (l >= rx || r <= lx || !pred(info[p])) {
      return -1;
    }
    if (r - l == 1) {
      return l;
    }
    int m = (l + r) / 2;
    push(p);
    int res = find_first(2 * p, l, m, lx, rx, pred);
    if (res == -1) {
      res = find_first(2 * p + 1, m, r, lx, rx, pred);
    }
    return res;
  }
  template <class F = std::function<bool(const Info&)>>
  int find_first(int lx, int rx, F pred) {
    return find_first(1, 0, n, lx, rx, pred);
  }
  template <class F = std::function<bool(const Info&)>>
  int find_last(int p, int l, int r, int lx, int rx,
                F pred) {
    if (l >= rx || r <= lx || !pred(info[p])) {
      return -1;
    }
    if (r - l == 1) {
      return l;
    }
    int m = (l + r) / 2;
    push(p);
    int res = find_last(2 * p + 1, m, r, lx, rx, pred);
    if (res == -1) {
      res = find_last(2 * p, l, m, lx, rx, pred);
    }
    return res;
  }
  template <class F = std::function<bool(const Info&)>>
  int find_last(int lx, int rx, F pred) {
    return find_last(1, 0, n, lx, rx, pred);
  }
};

struct Tag {
  int add = 0;

  void apply(Tag t) {
    add = max(add, t.add);
  }
};

struct Info {
  int val = 0;
  int best = 0;

  void apply(Tag t) {
    best = max(best, val + t.add);
  }
};

Info operator+(Info a, Info b) {
  return {max(a.val, b.val), max(a.best, b.best)};
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int n;
  cin >> n;

  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }

  int q;
  cin >> q;

  vector<int> l(q), r(q);
  vector<vector<int>> qs(n);
  for (int i = 0; i < q; ++i) {
    cin >> l[i] >> r[i];
    --l[i];
    qs[l[i]].push_back(i);
  }

  vector<int> ans(q);
  LazySegmentTree<Info, Tag> seg(n);
  for (int i = 0; i < n; ++i) {
    seg.modify(i, {a[i], 0});
  }
  vector<int> stk;
  for (int i = n - 1; i >= 0; --i) {
    while (!stk.empty()) {
      int j = stk.back();
      stk.pop_back();
      seg.range_apply(j + (j - i), n, Tag{a[i] + a[j]});
      if (a[j] > a[i]) {
        stk.push_back(j);
        break;
      }
    }
    stk.push_back(i);
    for (int p : qs[i]) {
      ans[p] = seg.range_query(i, r[p]).best;
    }
  }

  for (int i = 0; i < q; ++i) {
    cout << ans[i] << "\n";
  }

  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 460 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 460 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 217 ms 19796 KB Output is correct
12 Correct 211 ms 19764 KB Output is correct
13 Correct 211 ms 19796 KB Output is correct
14 Correct 207 ms 19980 KB Output is correct
15 Correct 204 ms 19780 KB Output is correct
16 Correct 214 ms 19140 KB Output is correct
17 Correct 222 ms 19236 KB Output is correct
18 Correct 214 ms 19028 KB Output is correct
19 Correct 210 ms 19804 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 15188 KB Output is correct
2 Correct 118 ms 15412 KB Output is correct
3 Correct 97 ms 15196 KB Output is correct
4 Correct 157 ms 15176 KB Output is correct
5 Correct 152 ms 15180 KB Output is correct
6 Correct 135 ms 14684 KB Output is correct
7 Correct 134 ms 14520 KB Output is correct
8 Correct 154 ms 14424 KB Output is correct
9 Correct 135 ms 14928 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 460 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 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 217 ms 19796 KB Output is correct
12 Correct 211 ms 19764 KB Output is correct
13 Correct 211 ms 19796 KB Output is correct
14 Correct 207 ms 19980 KB Output is correct
15 Correct 204 ms 19780 KB Output is correct
16 Correct 214 ms 19140 KB Output is correct
17 Correct 222 ms 19236 KB Output is correct
18 Correct 214 ms 19028 KB Output is correct
19 Correct 210 ms 19804 KB Output is correct
20 Correct 140 ms 15188 KB Output is correct
21 Correct 118 ms 15412 KB Output is correct
22 Correct 97 ms 15196 KB Output is correct
23 Correct 157 ms 15176 KB Output is correct
24 Correct 152 ms 15180 KB Output is correct
25 Correct 135 ms 14684 KB Output is correct
26 Correct 134 ms 14520 KB Output is correct
27 Correct 154 ms 14424 KB Output is correct
28 Correct 135 ms 14928 KB Output is correct
29 Correct 947 ms 57172 KB Output is correct
30 Correct 784 ms 61456 KB Output is correct
31 Correct 834 ms 57176 KB Output is correct
32 Correct 838 ms 57104 KB Output is correct
33 Correct 883 ms 57172 KB Output is correct
34 Correct 886 ms 55056 KB Output is correct
35 Correct 873 ms 54544 KB Output is correct
36 Correct 900 ms 54524 KB Output is correct
37 Correct 873 ms 56384 KB Output is correct
38 Correct 610 ms 64120 KB Output is correct
39 Correct 614 ms 63908 KB Output is correct
40 Correct 600 ms 61076 KB Output is correct
41 Correct 624 ms 60756 KB Output is correct
42 Correct 615 ms 60780 KB Output is correct
43 Correct 598 ms 61780 KB Output is correct
44 Correct 672 ms 63256 KB Output is correct
45 Correct 665 ms 63264 KB Output is correct
46 Correct 632 ms 60500 KB Output is correct
47 Correct 685 ms 60500 KB Output is correct
48 Correct 648 ms 60496 KB Output is correct
49 Correct 672 ms 61716 KB Output is correct
50 Correct 729 ms 60920 KB Output is correct
51 Correct 712 ms 60924 KB Output is correct
52 Correct 774 ms 58564 KB Output is correct
53 Correct 747 ms 58060 KB Output is correct
54 Correct 726 ms 58292 KB Output is correct
55 Correct 715 ms 59712 KB Output is correct