#556757 (C++17) No.1234 典型RMQ

• 問題: No.1234 典型RMQ
• ユーザー: jupiro
• 提出日時: 2020-09-22 05:27:59
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 92 ms / 2,000 ms
• コード長: 4,103 bytes
• コンパイル時間: 1,685 ms
• コンパイル使用メモリ: 136,600 KB
• 実行使用メモリ: 7,296 KB
• 最終ジャッジ日時: 2024-11-09 02:23:29
• 合計ジャッジ時間: 5,535 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	81 ms; 7,296 KB
testcase_07	AC	58 ms; 5,248 KB
testcase_08	AC	88 ms; 7,296 KB
testcase_09	AC	72 ms; 5,248 KB
testcase_10	AC	90 ms; 7,296 KB
testcase_11	AC	79 ms; 7,296 KB
testcase_12	AC	70 ms; 5,248 KB
testcase_13	AC	59 ms; 5,248 KB
testcase_14	AC	71 ms; 5,248 KB
testcase_15	AC	70 ms; 5,248 KB
testcase_16	AC	87 ms; 7,296 KB
testcase_17	AC	73 ms; 5,376 KB
testcase_18	AC	53 ms; 5,248 KB
testcase_19	AC	92 ms; 7,168 KB
testcase_20	AC	59 ms; 7,296 KB
testcase_21	AC	83 ms; 7,296 KB
testcase_22	AC	67 ms; 7,296 KB
testcase_23	AC	68 ms; 7,296 KB
testcase_24	AC	68 ms; 7,296 KB
testcase_25	AC	68 ms; 7,296 KB
testcase_26	AC	68 ms; 7,296 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	2 ms; 5,248 KB
testcase_29	AC	2 ms; 5,248 KB

ソースコード

#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
#include <cctype>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <utility>
#include <fstream>

using namespace std;
typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { a = abs(a), b = abs(b); while (b > 0) { tie(a, b) = make_pair(b, a % b); } return a; }
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
//constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353;
constexpr int MAX = 5000000;


ll f(ll a, ll b) {
    return min(a, b);
}

ll g(ll a, ll b) {
    return a + b;
}

ll h(ll a, ll b) {
    return a + b;
}
template< typename Monoid, typename OperatorMonoid = Monoid >
struct LazySegmentTree {
    /*
    using F = function< Monoid(Monoid, Monoid) >;
    using G = function< Monoid(Monoid, OperatorMonoid) >;
    using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;
    */
    int sz, height;
    vector< Monoid > data;
    vector< OperatorMonoid > lazy;
    /*
    const F f;
    const G g;
    const H h;
    */
    const Monoid M1;
    const OperatorMonoid OM0;


    LazySegmentTree(int n, /*const F f, const G g, const H h,*/
        const Monoid& M1, const OperatorMonoid OM0)
        : /*f(f), g(g), h(h),*/ M1(M1), OM0(OM0) {
        sz = 1;
        height = 0;
        while (sz < n) sz <<= 1, height++;
        data.assign(2 * sz, M1);
        lazy.assign(2 * sz, OM0);
    }

    void set(int k, const Monoid& x) {
        data[k + sz] = x;
    }

    void build() {
        for (int k = sz - 1; k > 0; k--) {
            data[k] = f(data[2 * k + 0], data[2 * k + 1]);
        }
    }

    inline void propagate(int k) {
        if (lazy[k] != OM0) {
            lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
            lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
            data[k] = reflect(k);
            lazy[k] = OM0;
        }
    }

    inline Monoid reflect(int k) {
        return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
    }

    inline void recalc(int k) {
        while (k >>= 1) data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
    }

    inline void thrust(int k) {
        for (int i = height; i > 0; i--) propagate(k >> i);
    }

    void update(int a, int b, const OperatorMonoid& x) {
        if (a >= b) return;
        thrust(a += sz);
        thrust(b += sz - 1);
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) lazy[l] = h(lazy[l], x), ++l;
            if (r & 1) --r, lazy[r] = h(lazy[r], x);
        }
        recalc(a);
        recalc(b);
    }

    Monoid query(int a, int b) {
        if (a >= b) return M1;
        thrust(a += sz);
        thrust(b += sz - 1);
        Monoid L = M1, R = M1;
        for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if (l & 1) L = f(L, reflect(l++));
            if (r & 1) R = f(reflect(--r), R);
        }
        return f(L, R);
    }

    Monoid operator[](const int& k) {
        return query(k, k + 1);
    }

};


int main()
{

	cin.tie(nullptr);
	ios::sync_with_stdio(false);

    int n; cin >> n;
    LazySegmentTree<ll, ll> lsg(n, INF, 0);
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        lsg.set(i, x);
    }
    lsg.build();
    int kkt; cin >> kkt;
    while (kkt--) {
        ll k, l, r, c; cin >> k >> l >> r >> c;
        l--;
        if (k == 1) {
            lsg.update(l, r, c);
        }
        else {
            cout << lsg.query(l, r) << "\n";
        }
    }
	return 0;
}