segmenttree/trees/acl_range-add-chmax-range-sum.hpp

• View this file on GitHub
• Last update: 2024-04-28 17:28:53+09:00
• Include: #include "segmenttree/trees/acl_range-add-chmax-range-sum.hpp"
• Link: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0427

Depends on

• Segment Tree Beats (based on atcoder::lazy_segtree) (segmenttree/acl_beats.hpp)
• Lazy Segtree (based on atcoder::lazy_segtree) (segmenttree/acl_lazysegtree.hpp)

Verified with

• segmenttree/test/beats_range-add-chmax-range-sum.test.cpp

Code

#pragma once
#include "../acl_beats.hpp"

// CUT begin
// Verified: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0427
namespace RangeAddChmaxRangeSum {
#include <algorithm>

template <typename Num>
inline Num second_lowest(Num a, Num a2, Num c, Num c2) noexcept { // a < a2, c < c2
    return a == c ? std::min(a2, c2) : a2 <= c ? a2 : c2 <= a ? c2 : std::max(a, c);
}
using Num = int;
constexpr Num INF = 1 << 30;

struct S {
    Num lo, lo2, sum;
    unsigned sz, nlo;
    bool fail;
    S() : lo(INF), lo2(INF), sum(0), sz(0), nlo(0), fail(false) {}
    S(Num x, unsigned sz_ = 1)
        : lo(x), lo2(INF), sum(Num(x) * sz_), sz(sz_), nlo(sz_), fail(false) {}
};

S e() { return S(); }

S op(S l, S r) {
    S ret;
    ret.lo = std::min(l.lo, r.lo);
    ret.lo2 = second_lowest(l.lo, l.lo2, r.lo, r.lo2);
    ret.sum = l.sum + r.sum, ret.sz = l.sz + r.sz;
    ret.nlo = l.nlo * (l.lo <= r.lo) + r.nlo * (r.lo <= l.lo);
    return ret;
}

struct F {
    Num lb, bias;
    F() : lb(-INF), bias(0) {}
    F(Num chmax_, Num add) : lb(chmax_), bias(add) {}
    static F chmax(Num x) noexcept { return F(x, Num(0)); }
    static F add(Num x) noexcept { return F(-INF, x); };
};

F composition(F fnew, F fold) {
    F ret;
    ret.lb = std::max(fold.lb + fold.bias, fnew.lb) - fold.bias;
    ret.bias = fold.bias + fnew.bias;
    return ret;
}

F id() { return F(); }
S mapping(F f, S x) {
    if (x.sz == 0) return e();
    if (f.lb < x.lo2) {
        Num nxt_lo = std::max(x.lo, f.lb);
        x.sum += (nxt_lo - x.lo) * x.nlo + f.bias * x.sz;
        x.lo = nxt_lo + f.bias, x.lo2 += f.bias;
        return x;
    }
    x.fail = 1;
    return x;
}
using segtree = segtree_beats<S, op, e, F, mapping, composition, id>;
} // namespace RangeAddChmaxRangeSum

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.13.5/x64/lib/python3.13/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.13.5/x64/lib/python3.13/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
    bundler.update(path)
    ~~~~~~~~~~~~~~^^^^^^
  File "/opt/hostedtoolcache/Python/3.13.5/x64/lib/python3.13/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
    ~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.13.5/x64/lib/python3.13/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
    ~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.13.5/x64/lib/python3.13/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 355, in update
    raise BundleErrorAt(path, i + 1, "found codes out of include guard")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: segmenttree/acl_lazysegtree.hpp: line 37: found codes out of include guard

Back to top page