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

• 問題: No.1234 典型RMQ
• ユーザー: Shibuyap
• 提出日時: 2020-09-18 21:48:02
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 244 ms / 2,000 ms
• コード長: 2,103 bytes
• コンパイル時間: 2,140 ms
• コンパイル使用メモリ: 193,996 KB
• 最終ジャッジ日時: 2025-01-14 16:56:11
• ジャッジサーバーID （参考情報）: judge4 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 27

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005
long long int INF = 1e18;
int const TREE_SIZE = 1 << 21;
long long int seg_tree[TREE_SIZE] = {};
long long int c_diff[TREE_SIZE] = {}; // 子との差
// [a, b) の最小値を求める
// find_(a, b, 1, 0, 0, TREE_SIZE / 2)
long long int find_(int a, int b, int index, long long int diff, int l, int r){
    seg_tree[index] += diff;
    c_diff[index] += diff;
    
    if(r <= a || b <= l){
        return INF;
    }
    if(a <= l && r <= b){
        return seg_tree[index];
    }
    
    long long int ret = INF;
    ret = min(ret, find_(a, b, index * 2, c_diff[index], l, (l + r) / 2));
    ret = min(ret, find_(a, b, index * 2 + 1, c_diff[index], (l + r) / 2, r));
    c_diff[index] = 0;
    return ret;
}
// [a, b) に num を足す
// add(a, b, 1, num, 0, 0, TREE_SIZE / 2);
long long int add(int a, int b, int index, long long int num, long long int diff, int l, int r){
    seg_tree[index] += diff;
    c_diff[index] += diff;
    
    if(r <= a || b <= l){
        return seg_tree[index];
    }
    if(a <= l && r <= b){
        seg_tree[index] += num;
        c_diff[index] += num;
        return seg_tree[index];
    }
    
    long long int ret = INF;
    ret = min(ret, add(a, b, index * 2, num, c_diff[index], l, (l + r) / 2));
    ret = min(ret, add(a, b, index * 2 + 1, num, c_diff[index], (l + r) / 2, r));
    c_diff[index] = 0;
    return seg_tree[index] = ret;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n, q;
    cin >> n;
    rep(i,n){
        ll a;
        cin >> a;
        add(i,i+1,1,a,0,0,TREE_SIZE/2);
    }
    
    cin >> q;
    for(int loop = 0; loop < q; loop++){
        long long int num, s, t, x;
        cin >> num;
        if(num == 1){
            cin >> s >> t >> x;
            s--; t--;
            add(s, t + 1, 1, x, 0, 0, TREE_SIZE / 2);
        }else{
            cin >> s >> t >> x;
            s--; t--;
            cout << find_(s, t + 1, 1, 0, 0, TREE_SIZE / 2) << endl;
        }
    }
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX