verify/LibraryChecker/data-structure/segment-tree/RangeChminChmaxAddRangeSum.test.cpp

• View this file on GitHub
• Last update: 2024-12-12 00:16:43+09:00
• Problem: https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum

Depends on

• Segment Tree Beats (data-structure/segment-tree/SegmentTreeBeatsChminChmax.hpp)
• Template (template/template.hpp)

Code

#include "../../../../template/template.hpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
#include "../../../../data-structure/segment-tree/SegmentTreeBeatsChminChmax.hpp"

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    in(n, q);
    vector<lint> a(n);
    in(a);
    SegtreeBeats<lint> seg(a);

    rep(i, q) {
        int com, l, r;
        lint x;
        in(com, l, r);
        if (com == 0) {
            in(x);
            seg.range_chmin(l, r, x);
        } else if (com == 1) {
            in(x);
            seg.range_chmax(l, r, x);
        } else if (com == 2) {
            in(x);
            seg.range_add(l, r, x);
        } else if (com == 3) {
            out(seg.range_sum(l, r));
        }
    }
}

#line 2 "template/template.hpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ull = unsigned long long;
using ld = long double;
using int128 = __int128_t;
#define all(x) (x).begin(), (x).end()
#define uniqv(v) v.erase(unique(all(v)), v.end())
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define logfixed(x) cout << fixed << setprecision(10) << x << endl;

ostream &operator<<(ostream &dest, __int128_t value) {
  ostream::sentry s(dest);
  if (s) {
    __uint128_t tmp = value < 0 ? -value : value;
    char buffer[128];
    char *d = end(buffer);
    do {
      --d;
      *d = "0123456789"[tmp % 10];
      tmp /= 10;
    } while (tmp != 0);
    if (value < 0) {
      --d;
      *d = '-';
    }
    int len = end(buffer) - d;
    if (dest.rdbuf()->sputn(d, len) != len) {
      dest.setstate(ios_base::badbit);
    }
  }
  return dest;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != (int)v.size() ? " " : "");
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &set_var) {
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end()) os << " ";
    itr--;
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const unordered_map<T, U> &map_var) {
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << itr->first << " -> " << itr->second << "\n";
  }
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) {
  os << pair_var.first << " " << pair_var.second;
  return os;
}

void out() { cout << '\n'; }
template <class T, class... Ts>
void out(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

void outf() { cout << '\n'; }
template <class T, class... Ts>
void outf(const T &a, const Ts &...b) {
  cout << fixed << setprecision(14) << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

inline void in(void) { return; }
template <typename First, typename... Rest>
void in(First &first, Rest &...rest) {
  cin >> first;
  in(rest...);
  return;
}

template <typename T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

vector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};
vector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};
vector<lint> dx4 = {1, 0, -1, 0};
vector<lint> dy4 = {0, 1, 0, -1};

#pragma endregion
#line 2 "verify/LibraryChecker/data-structure/segment-tree/RangeChminChmaxAddRangeSum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_chmin_chmax_add_range_sum"
#line 1 "data-structure/segment-tree/SegmentTreeBeatsChminChmax.hpp"
template <class T>
class SegtreeBeats {
   private:
    T MA, MI;
    int n;
    int n0;
    vector<T> max_1_val, max_2_val, min_1_val, min_2_val, sum, add;
    vector<int> max_1_cnt, min_1_cnt, len;

    void query_chmin(int a, int b, int k, int l, int r, T x) {
        if (b <= l or r <= a or max_1_val[k] <= x) {
            return;
        }

        if (a <= l and r <= b and max_2_val[k] < x) {
            update_node_max(k, x);
            return;
        }

        push(k);

        query_chmin(a, b, (k << 1) | 1, l, (l + r) >> 1, x);
        query_chmin(a, b, (k + 1) << 1, (l + r) >> 1, r, x);

        update(k);
    }

    void query_chmax(int a, int b, int k, int l, int r, T x) {
        if (b <= l or r <= a or x <= min_1_val[k]) {
            return;
        }

        if (a <= l and r <= b and x < min_2_val[k]) {
            update_node_min(k, x);
            return;
        }

        push(k);

        query_chmax(a, b, (k << 1) | 1, l, (l + r) >> 1, x);
        query_chmax(a, b, (k + 1) << 1, (l + r) >> 1, r, x);

        update(k);
    }

    T query_max(int a, int b, int k, int l, int r) {
        if (b <= l or r <= a) {
            return MI;
        }

        if (a <= l and r <= b) {
            return max_1_val[k];
        }

        push(k);
        T l_max = query_max(a, b, (k << 1) | 1, l, (l + r) >> 1);
        T r_max = query_max(a, b, (k + 1) << 1, (l + r) >> 1, r);
        return max(l_max, r_max);
    }

    T query_min(int a, int b, int k, int l, int r) {
        if (b <= l or r <= a) {
            return MA;
        }

        if (a <= l and r <= b) {
            return min_1_val[k];
        }

        push(k);
        T l_max = query_min(a, b, (k << 1) | 1, l, (l + r) >> 1);
        T r_max = query_min(a, b, (k + 1) << 1, (l + r) >> 1, r);
        return min(l_max, r_max);
    }

    T query_sum(int a, int b, int k, int l, int r) {
        if (b <= l or r <= a) {
            return 0;
        }

        if (a <= l and r <= b) {
            return sum[k];
        }

        push(k);
        T l_sum = query_sum(a, b, (k << 1) | 1, l, (l + r) >> 1);
        T r_sum = query_sum(a, b, (k + 1) << 1, (l + r) >> 1, r);
        return l_sum + r_sum;
    }

    void query_add(int a, int b, int k, int l, int r, T x) {
        if (b <= l or r <= a) {
            return;
        }

        if (a <= l and r <= b) {
            add_node(k, x);
            return;
        }

        push(k);
        query_add(a, b, (k << 1) | 1, l, (l + r) >> 1, x);
        query_add(a, b, (k + 1) << 1, (l + r) >> 1, r, x);
        update(k);
    }

    void update_node_max(int k, T x) {
        sum[k] += (x - max_1_val[k]) * max_1_cnt[k];
        if (max_1_val[k] == min_1_val[k]) {
            max_1_val[k] = x;
            min_1_val[k] = x;
        } else if (max_1_val[k] == min_2_val[k]) {
            max_1_val[k] = x;
            min_2_val[k] = x;
        } else {
            max_1_val[k] = x;
        }
    }

    void update_node_min(int k, T x) {
        sum[k] += (x - min_1_val[k]) * min_1_cnt[k];

        if (max_1_val[k] == min_1_val[k]) {
            max_1_val[k] = x;
            min_1_val[k] = x;
        } else if (max_2_val[k] == min_1_val[k]) {
            max_2_val[k] = x;
            min_1_val[k] = x;
        } else {
            min_1_val[k] = x;
        }
    }

    void add_node(int k, T x) {
        max_1_val[k] += x;
        if (max_2_val[k] != MI) {
            max_2_val[k] += x;
        }
        min_1_val[k] += x;
        if (min_2_val[k] != MA) {
            min_2_val[k] += x;
        }

        sum[k] += len[k] * x;
        add[k] += x;
    }

    void push(int k) {
        if (add[k] != 0) {
            add_node((k << 1) | 1, add[k]);
            add_node((k + 1) << 1, add[k]);
            add[k] = 0;
        }

        if (max_1_val[k] < max_1_val[(k << 1) | 1]) {
            update_node_max((k << 1) | 1, max_1_val[k]);
        }

        if (max_1_val[k] < max_1_val[(k + 1) << 1]) {
            update_node_max((k + 1) << 1, max_1_val[k]);
        }

        if (min_1_val[k] > min_1_val[(k << 1) | 1]) {
            update_node_min((k << 1) | 1, min_1_val[k]);
        }

        if (min_1_val[k] > min_1_val[(k + 1) << 1]) {
            update_node_min((k + 1) << 1, min_1_val[k]);
        }
    }

    void update(int k) {
        sum[k] = sum[(k << 1) | 1] + sum[(k + 1) << 1];

        if (max_1_val[(k << 1) | 1] < max_1_val[(k + 1) << 1]) {
            max_1_val[k] = max_1_val[(k + 1) << 1];
            max_1_cnt[k] = max_1_cnt[(k + 1) << 1];
            max_2_val[k] = max(max_1_val[(k << 1) | 1], max_2_val[(k + 1) << 1]);
        } else if (max_1_val[(k << 1) | 1] > max_1_val[(k + 1) << 1]) {
            max_1_val[k] = max_1_val[(k << 1) | 1];
            max_1_cnt[k] = max_1_cnt[(k << 1) | 1];
            max_2_val[k] = max(max_2_val[(k << 1) | 1], max_1_val[(k + 1) << 1]);
        } else {
            max_1_val[k] = max_1_val[(k << 1) | 1];
            max_1_cnt[k] = max_1_cnt[(k << 1) | 1] + max_1_cnt[(k + 1) << 1];
            max_2_val[k] = max(max_2_val[(k << 1) | 1], max_2_val[(k + 1) << 1]);
        }

        if (min_1_val[(k << 1) | 1] < min_1_val[(k + 1) << 1]) {
            min_1_val[k] = min_1_val[(k << 1) | 1];
            min_1_cnt[k] = min_1_cnt[(k << 1) | 1];
            min_2_val[k] = min(min_2_val[(k << 1) | 1], min_1_val[(k + 1) << 1]);
        } else if (min_1_val[(k << 1) | 1] > min_1_val[(k + 1) << 1]) {
            min_1_val[k] = min_1_val[(k + 1) << 1];
            min_1_cnt[k] = min_1_cnt[(k + 1) << 1];
            min_2_val[k] = min(min_1_val[(k << 1) | 1], min_2_val[(k + 1) << 1]);
        } else {
            min_1_val[k] = min_1_val[(k << 1) | 1];
            min_1_cnt[k] = min_1_cnt[(k << 1) | 1] + min_1_cnt[(k + 1) << 1];
            min_2_val[k] = min(min_2_val[(k << 1) | 1], min_2_val[(k + 1) << 1]);
        }
    }

   public:
    SegtreeBeats(const vector<T> &v) {
        MA = numeric_limits<T>::max();
        MI = numeric_limits<T>::min();
        n = v.size();
        n0 = 1;
        while (n0 < n) {
            n0 <<= 1;
        }
        sum.assign((n0 << 1), 0);
        add.assign((n0 << 1), 0);
        len.assign((n0 << 1), 0);
        max_1_val.assign((n0 << 1), MI);
        max_2_val.assign((n0 << 1), MI);
        min_1_val.assign((n0 << 1), MA);
        min_2_val.assign((n0 << 1), MA);
        max_1_cnt.assign((n0 << 1), 0);
        min_1_cnt.assign((n0 << 1), 0);

        for (int i = 0; i < (n0 << 1); i++) {
            add[i] = 0;
        }
        len[0] = n0;
        for (int i = 0; i < n0 - 1; i++) {
            len[(i << 1) | 1] = (len[i] >> 1);
            len[(i + 1) << 1] = (len[i] >> 1);
        }

        for (int i = 0; i < n; i++) {
            max_1_val[n0 - 1 + i] = v[i];
            min_1_val[n0 - 1 + i] = v[i];
            sum[n0 - 1 + i] = v[i];
            max_1_cnt[n0 - 1 + i] = 1;
            min_1_cnt[n0 - 1 + i] = 1;
        }

        for (int i = n0 - 2; i >= 0; i--) {
            update(i);
        }
    }

    void range_chmin(int l, int r, T x) {
        query_chmin(l, r, 0, 0, n0, x);
    }

    void range_chmax(int l, int r, T x) {
        query_chmax(l, r, 0, 0, n0, x);
    }

    void range_add(int l, int r, T x) {
        query_add(l, r, 0, 0, n0, x);
    }

    void range_update(int l, int r, T x) {
        query_chmax(l, r, MA);
        query_chmin(l, r, x);
    }

    T range_max(int l, int r) {
        return query_max(l, r, 0, 0, n0);
    }

    T range_min(int l, int r) {
        return query_min(l, r, 0, 0, n0);
    }

    T range_sum(int l, int r) {
        return query_sum(l, r, 0, 0, n0);
    }

    T get(int p) {
        return range_sum(p, p + 1);
    }

    T set(int p, T x) {
        range_update(p, p + 1, x);
    }

    void print() {
        for (int i = 0; i < n; i++) {
            cout << get(i) << (i == n - 1) ? '\n' : " ";
        }
    }
};
#line 4 "verify/LibraryChecker/data-structure/segment-tree/RangeChminChmaxAddRangeSum.test.cpp"

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    in(n, q);
    vector<lint> a(n);
    in(a);
    SegtreeBeats<lint> seg(a);

    rep(i, q) {
        int com, l, r;
        lint x;
        in(com, l, r);
        if (com == 0) {
            in(x);
            seg.range_chmin(l, r, x);
        } else if (com == 1) {
            in(x);
            seg.range_chmax(l, r, x);
        } else if (com == 2) {
            in(x);
            seg.range_add(l, r, x);
        } else if (com == 3) {
            out(seg.range_sum(l, r));
        }
    }
}

Back to top page