結果

問題 No.1234 典型RMQ
ユーザー Imperi_NightImperi_Night
提出日時 2020-09-18 21:59:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 112 ms / 2,000 ms
コード長 5,811 bytes
コンパイル時間 1,911 ms
コンパイル使用メモリ 140,256 KB
実行使用メモリ 9,088 KB
最終ジャッジ日時 2024-04-26 11:09:04
合計ジャッジ時間 5,750 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 99 ms
8,448 KB
testcase_07 AC 79 ms
5,376 KB
testcase_08 AC 106 ms
8,832 KB
testcase_09 AC 92 ms
6,144 KB
testcase_10 AC 105 ms
8,576 KB
testcase_11 AC 101 ms
8,192 KB
testcase_12 AC 87 ms
5,760 KB
testcase_13 AC 78 ms
5,376 KB
testcase_14 AC 86 ms
5,888 KB
testcase_15 AC 86 ms
5,632 KB
testcase_16 AC 106 ms
8,576 KB
testcase_17 AC 94 ms
6,016 KB
testcase_18 AC 74 ms
5,376 KB
testcase_19 AC 112 ms
8,960 KB
testcase_20 AC 71 ms
8,960 KB
testcase_21 AC 102 ms
8,320 KB
testcase_22 AC 86 ms
8,832 KB
testcase_23 AC 85 ms
9,088 KB
testcase_24 AC 85 ms
8,832 KB
testcase_25 AC 81 ms
8,960 KB
testcase_26 AC 84 ms
8,960 KB
testcase_27 AC 1 ms
5,376 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "main.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>

/* template start */

using i64 = std::int_fast64_t;
using u64 = std::uint_fast64_t;

#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()

#ifdef LOCAL
#define debug(...)                                                    \
  std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
      debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
  std::cerr << " " << h;
  if (sizeof...(t) > 0) std::cout << " :";
  debug_out(t...);
}

template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}

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

template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  return a > b && (a = b, true);
}

template <typename Num>
constexpr Num mypow(Num a, u64 b, Num id = 1) {
  if (b == 0) return id;
  Num x = id;
  while (b > 0) {
    if (b & 1) x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

/* template end */

#line 2 "/home/imperi/cp-library/lib/SegmentTree/LazySegmentTree.hpp"

#line 5 "/home/imperi/cp-library/lib/SegmentTree/LazySegmentTree.hpp"

// Lazy
// type value_t
// type lazy_t
// static value_t id_val
// static value_t id_lazy
// static (value_t,value_t) -> value_t f
// static (value_t,lazy_t) -> value_t g
// static (lazy_t,lazy_t) -> lazy_t h
// static (lazy_t,size_t) -> lazy_t p

/* Lazy template

struct Lazy{
  using value_t= ~~ ;
  using lazy_t= ~~ ;
  static constexpr value_t id_val= ~~ ;
  static constexpr lazy_t id_lazy= ~~ ;
  static value_t f(value_t a,value_t b){
    return ~~ ;
  }
  static value_t g(value_t a,lazy_t b){
    return ~~ ;
  }
  static lazy_t h(lazy_t a,lazy_t b){
    return ~~ ;
  }
  static lazy_t p(lazy_t a,std::size_t n){
    return ~~ ;
  }
};

*/

template <typename Lazy>
class LazySegmentTree {
 public:
  using value_t = typename Lazy::value_t;
  using lazy_t = typename Lazy::lazy_t;
  using size_t = std::size_t;

 private:
  size_t n, n0;
  std::vector<value_t> val;
  std::vector<lazy_t> lazy;

  value_t update(size_t a, size_t b, lazy_t laz, size_t l, size_t r, size_t k) {
    if (lazy[k] != Lazy::id_lazy) {
      if (k < n0 - 1) {
        lazy[2 * k + 1] = Lazy::h(lazy[2 * k + 1], lazy[k]);
        lazy[2 * k + 2] = Lazy::h(lazy[2 * k + 2], lazy[k]);
      }
      val[k] = Lazy::g(val[k], Lazy::p(lazy[k], r - l));
      lazy[k] = Lazy::id_lazy;
    }

    if (r <= a || b <= l) return val[k];
    if (a <= l && r <= b) {
      lazy[k] = Lazy::h(lazy[k], laz);
      return Lazy::g(val[k], Lazy::p(lazy[k], r - l));
    }
    return val[k] = Lazy::f(update(a, b, laz, l, l + (r - l) / 2, 2 * k + 1),
                            update(a, b, laz, l + (r - l) / 2, r, 2 * k + 2));
  }

  value_t fold(size_t a, size_t b, size_t l, size_t r, size_t k) {
    if (lazy[k] != Lazy::id_lazy) {
      if (k < n0 - 1) {
        lazy[2 * k + 1] = Lazy::h(lazy[2 * k + 1], lazy[k]);
        lazy[2 * k + 2] = Lazy::h(lazy[2 * k + 2], lazy[k]);
      }
      val[k] = Lazy::g(val[k], Lazy::p(lazy[k], r - l));
      lazy[k] = Lazy::id_lazy;
    }

    if (r <= a || b <= l) return Lazy::id_val;
    if (a <= l && r <= b) return val[k];
    return Lazy::f(fold(a, b, l, l + (r - l) / 2, 2 * k + 1),
                   fold(a, b, l + (r - l) / 2, r, 2 * k + 2));
  }

  inline size_t beki(size_t n_) {
    size_t ret = 1;
    while (ret < n_) ret <<= 1;
    return ret;
  }

 public:
  LazySegmentTree(size_t n_)
      : n(n_),
        n0(beki(n)),
        val(2 * n0 - 1, Lazy::id_val),
        lazy(2 * n0 - 1, Lazy::id_lazy) {}

  LazySegmentTree(std::vector<value_t> val_)
      : n(val_.size()),
        n0(beki(n)),
        val(2 * n0 - 1, Lazy::id_val),
        lazy(2 * n0 - 1, Lazy::id_lazy) {
    for (size_t i = 0; i < n; i++) val[i + n0 - 1] = val_[i];
    for (long long i = n0 - 2; i >= 0; i--)
      val[i] = Lazy::f(val[2 * i + 1], val[2 * i + 2]);
  }

  void update(size_t a, size_t b, lazy_t laz) { update(a, b, laz, 0, n0, 0); }

  value_t fold(size_t a, size_t b) { return fold(a, b, 0, n0, 0); }
};
#line 92 "main.cpp"

struct Lazy{
  using value_t= i64 ;
  using lazy_t= i64 ;
  static constexpr value_t id_val= 1e18 ;
  static constexpr lazy_t id_lazy= 0 ;
  static value_t f(value_t a,value_t b){
    return std::min(a,b) ;
  }
  static value_t g(value_t a,lazy_t b){
    return a+b ;
  }
  static lazy_t h(lazy_t a,lazy_t b){
    return a+b ;
  }
  static lazy_t p(lazy_t a,std::size_t n){
    return a ;
  }
};

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

  i64 n;
  std::cin>>n;

  std::vector<i64> a(n);
  for(auto&& e:a)std::cin>>e;

  LazySegmentTree<Lazy> seg(a);

  i64 q;
  std::cin>>q;

  while(q--){
    i64 k,l,r,c;
    std::cin>>k>>l>>r>>c;
    l--;
    if(k==1){
      seg.update(l,r,c);
    }else{
      std::cout<<seg.fold(l,r)<<"\n";
    }
  }

  return 0;
}
0