結果

問題 No.3411 Range Clamp Sum
コンテスト
ユーザー Kude
提出日時 2025-12-18 03:19:04
言語 C++23
(gcc 13.3.0 + boost 1.89.0)
結果
AC  
実行時間 789 ms / 10,000 ms
コード長 8,034 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 4,118 ms
コンパイル使用メモリ 329,524 KB
実行使用メモリ 40,320 KB
最終ジャッジ日時 2025-12-18 03:19:23
合計ジャッジ時間 15,697 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

#pragma GCC target("popcnt")

template <class D, auto D_build, class Q, auto Q_op, auto Q_e, auto D_query>
struct AbstractWaveletMatrix {
  int height = 0;
  int n = 0;
  using storage_type = unsigned int;
  static constexpr int B = numeric_limits<storage_type>::digits,
                       LowBits = __lg(B);
  static_assert(B == 1 << LowBits);
  struct BVecElem {
    storage_type v;
    int acc;
  };
  struct BitVector;
  vector<BVecElem> bvecs_storage;
  vector<BitVector> bvecs;
  vector<D> D_data;
  struct BitVector {
    span<BVecElem> d;
    int zeros;
    BitVector(span<BVecElem> d, int k, const auto& a, auto& na) : d(d) {
      int n = size(a);
      int ptr0 = 0, ptr1 = n;
      for (int i = 0; i < n; i += B) {
        int len = min(B, n - i);
        storage_type x = 0;
        for (int i_low = 0; i_low < len; i_low++) {
          bool bit = a[i | i_low] >> k & 1;
          if (!bit) {
            na[ptr0++] = a[i | i_low];
          } else {
            x |= storage_type(bit) << i_low;
            na[--ptr1] = a[i | i_low];
          }
        }
        d[i >> LowBits].v = x;
      }
      assert(ptr0 == ptr1);
      zeros = ptr0;
      reverse(na.begin() + ptr0, na.begin() + n);
      for (int i = 0, sz = size(d); i + 1 < sz; i++) {
        d[i + 1].acc = d[i].acc + popcount(d[i].v);
      }
    }
    int rank1(int i) {
      auto di = d[i >> LowBits];
      int low = i & (B - 1);
      auto mask = (storage_type(1) << low) - 1;
      return di.acc + popcount(di.v & mask);
    }
    int rank(bool b, int i) { return b == 0 ? i - rank1(i) : rank1(i); }
    int mv(bool b, int i) { return b == 0 ? i - rank1(i) : zeros + rank1(i); }
  };

  AbstractWaveletMatrix() = default;
  template <class T>
  AbstractWaveletMatrix(vector<T> a) {
    auto mx = empty(a) ? 0 : *max_element(begin(a), end(a));
    height = mx == 0 ? 0 : __lg(mx) + 1;
    n = size(a);
    int block_count = (n >> LowBits) + 1;
    bvecs_storage.resize(height * block_count);
    bvecs.reserve(height);
    vector<T> na(n);
    D_data.reserve(height + 1);
    D_data.emplace_back(D_build(a));
    for (int k = height - 1; k >= 0; k--) {
      bvecs.emplace_back(span(begin(bvecs_storage) + k * block_count, block_count), k, a, na);
      swap(a, na);
      D_data.emplace_back(D_build(a));
    }
    reverse(begin(bvecs), end(bvecs));
    reverse(begin(D_data), end(D_data));
  };

  // returns the number of occurrence of x in a[l, r)
  int rank(auto x, int l, int r) {
    assert(0 <= l && l <= r && r <= n);
    if (x >> height) return 0;
    for (int k = height - 1; k >= 0; k--) {
      bool bit = x >> k & 1;
      l = bvecs[k].mv(bit, l);
      r = bvecs[k].mv(bit, r);
    }
    return r - l;
  }
  int rangefreq_below(auto vr, int l, int r) {
    assert(0 <= l && l <= r && r <= n);
    if (vr <= 0) return 0;
    if (vr >> height) return r - l;
    int res = 0;
    for (int k = height - 1; k >= 0; k--) {
      bool bit = vr >> k & 1;
      if (bit) {
        int ones_r = bvecs[k].rank1(r), ones_l = bvecs[k].rank1(l);
        res += (r - l) - (ones_r - ones_l);
        l = bvecs[k].zeros + ones_l;
        r = bvecs[k].zeros + ones_r;
      } else {
        l = bvecs[k].mv(bit, l);
        r = bvecs[k].mv(bit, r);
      }
    }
    return res;
  }
  // returns the number of occurrence of values in [vl, vr) in a[l, r)
  int rangefreq(auto vl, auto vr, int l, int r) {
    assert(vl <= vr);
    return rangefreq_below(vr, l, r) - rangefreq_below(vl, l, r);
  }
  Q rangequery_below(auto vr, int l, int r) {
    assert(0 <= l && l <= r && r <= n);
    if (vr <= 0) return Q_e();
    if (vr >> height) return D_query(D_data[height], l, r);
    Q res = Q_e();
    for (int k = height - 1; k >= 0; k--) {
      bool bit = vr >> k & 1;
      if (bit) {
        int ones_r = bvecs[k].rank1(r), ones_l = bvecs[k].rank1(l);
        res = Q_op(res, D_query(D_data[k], l - ones_l, r - ones_r));
        l = bvecs[k].zeros + ones_l;
        r = bvecs[k].zeros + ones_r;
      } else {
        l = bvecs[k].mv(bit, l);
        r = bvecs[k].mv(bit, r);
      }
    }
    return res;
  }
  // returns the maximum vr s.t. # of points in [l, r) * [vl, vr) <= cnt_ub
  template <class T>
  T max_upper(T vl, int l, int r, int cnt_ub, T res_for_inf) {
    assert(0 <= l && l <= r && r <= n);
    assert(cnt_ub >= 0);
    assert(numeric_limits<T>::digits > height);
    cnt_ub += rangefreq_below(vl, l, r);
    if (cnt_ub >= r - l) return res_for_inf;
    T res = 0;
    for (int k = height - 1; k >= 0; k--) {
      int ones_l = bvecs[k].rank1(l), ones_r = bvecs[k].rank1(r);
      int zeros = (r - l) - (ones_r - ones_l);
      if (zeros <= cnt_ub) {
        cnt_ub -= zeros;
        res += T(1) << k;
        l = bvecs[k].zeros + ones_l;
        r = bvecs[k].zeros + ones_r;
      } else {
        l = l - ones_l;
        r = r - ones_r;
      }
    }
    return res;
  }
  template <class T>
  T min_lower(T vr, int l, int r, int cnt_ub) {
    assert(0 <= l && l <= r && r <= n);
    assert(cnt_ub >= 0);
    assert(numeric_limits<T>::digits > height);
    cnt_ub += (r - l) - rangefreq_below(vr, l, r);
    if (cnt_ub >= r - l) return 0;
    T res = T(1) << height;
    for (int k = height - 1; k >= 0; k--) {
      int ones_l = bvecs[k].rank1(l), ones_r = bvecs[k].rank1(r);
      int ones = ones_r - ones_l;
      if (ones <= cnt_ub) {
        cnt_ub -= ones;
        res -= T(1) << k;
        l = l - ones_l;
        r = r - ones_r;
      } else {
        l = bvecs[k].zeros + ones_l;
        r = bvecs[k].zeros + ones_r;
      }
    }
    return res;
  }
};


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, q;
  cin >> n >> q;
  VI a(n);
  rep(i, n) cin >> a[i];
  VI updcnt(n, 1);
  vector<tuple<int, int, int, int, int>> qs(q);
  for (auto& [t, l, r, a, b] : qs) {
    cin >> t;
    if (t == 1) {
      cin >> l >> r;
      l--;
      updcnt[l]++;
    } else {
      cin >> l >> r >> a >> b;
      l--;
    }
  }
  VI starts(n + 1);
  rep(i, n) starts[i+1] = starts[i] + updcnt[i];
  VI vals(starts[n]);
  rep(i, n) vals[starts[i]++] = a[i];
  for (auto [t, l, r, a, b] : qs) if (t == 1) {
    vals[starts[l]++] = r;
  }
  starts.pop_back();
  starts.insert(starts.begin(), 1, 0);
  struct D {
    fenwick_tree<int> s0;
    fenwick_tree<ll> s1;
  };
  struct Q {
    int s0;
    ll s1;
  };
  AbstractWaveletMatrix<D, [](const VI& a) {
    int n = a.size();
    return D{fenwick_tree<int>(n), fenwick_tree<ll>(n)};
  }, Q, [](Q x, Q y) { return Q{x.s0 + y.s0, x.s1 + y.s1}; }, []() { return Q{0, 0}; }, [](D& ft, int l, int r) {
    return Q{ft.s0.sum(l, r), ft.s1.sum(l, r)};
  }> wm(vals);
  auto add = [&](int i, int coeff) -> void {
    int k = wm.height;
    int val = vals[i];
    while (true) {
      wm.D_data[k].s0.add(i, coeff);
      wm.D_data[k].s1.add(i, coeff * val);
      if (k == 0) break;
      k--;
      i = wm.bvecs[k].mv(val >> k & 1, i);
    }
  };
  rep(i, n) add(starts[i], 1);
  for (auto [t, l, r, a, b] : qs) {
    if (t == 1) {
      add(starts[l], -1);
      starts[l]++;
      add(starts[l], 1);
    } else {
      Q qr = wm.rangequery_below(b, starts[l], starts[r]);
      Q ql = wm.rangequery_below(a, starts[l], starts[r]);
      ll ans = qr.s1 + ll(r - l - qr.s0) * b - ql.s1 + (ll)ql.s0 * a;
      cout << ans << '\n';
    }
  }
}
0