#1035577 (Rust) No.789 範囲の合計

• 問題: No.789 範囲の合計
• ユーザー: ArcAki
• 提出日時: 2025-01-17 02:48:36
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 106 ms / 1,000 ms
• コード長: 6,312 bytes
• コンパイル時間: 27,988 ms
• コンパイル使用メモリ: 378,288 KB
• 実行使用メモリ: 44,964 KB
• 最終ジャッジ日時: 2025-01-17 02:49:07
• 合計ジャッジ時間: 21,525 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
other	AC * 15

ソースコード

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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
#[allow(unused_imports)]
use std::{
    collections::*,
    cmp::*,
    mem::swap,
    time::Instant,
    io::{self, stdin, Read, read_to_string},
    hash::Hash,
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
/*
#[allow(unused_imports)]
use rand::{thread_rng, Rng, seq::SliceRandom};
#[allow(unused_imports)]
use ac_library::{*};
*/
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const MOD: i64 = 1<<60;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
pub fn bit_length(x: usize)->usize{
    64-x.saturating_sub(1).leading_zeros()as usize
}
pub trait SegTreeMonoid{
    type S: Copy;
    fn identity()->Self::S;
    fn op(a: &Self::S, b: &Self::S)->Self::S;
}
pub struct DynamicSegmenttree<M> where M: SegTreeMonoid{
    n: usize,
    data: Vec<(M::S, Option<usize>, Option<usize>)>,
}
impl<M> DynamicSegmenttree<M> where M: SegTreeMonoid{
    pub fn new(n: usize)->Self{
        let n = n.next_power_of_two();
        DynamicSegmenttree{
            n, data: vec![(M::identity(), None, None)]
        }
    }
    pub fn set(&mut self, p: usize, x: M::S){
        self.update_dfs(0, 0, self.n, p, x, false);
    }
    pub fn push(&mut self, p: usize, x: M::S){
        self.update_dfs(0, 0, self.n, p, x, true);
    }
    fn update_dfs(&mut self, p: usize, l: usize, r: usize, idx: usize, x: M::S, f: bool)->M::S{
        if l+1==r{
            let (pre, left, right) = self.data[p];
            if f{
                self.data[p] = (M::op(&pre, &x), left, right);
            } else {
                self.data[p] = (x, left, right);
            }
            return self.data[p].0;
        }
        let (_, mut left, mut right) = self.data[p];
        let m = (l+r)/2;
        let res = if idx < m{
            let res_l = if let Some(ln) = left{
                self.update_dfs(ln, l, m, idx, x, f)
            } else {
                let nex = self.data.len();
                left = Some(nex);
                self.data.push((M::identity(), None, None));
                self.update_dfs(nex, l, m, idx, x, f)
            };
            let res_r = if let Some(rn) = right{
                self.data[rn].0
            } else {
                M::identity()
            };
            M::op(&res_l, &res_r)
        } else {
            let res_l = if let Some(ln) = left{
                self.data[ln].0
            } else {
                M::identity()
            };
            let res_r = if let Some(rn) = right{
                self.update_dfs(rn, m, r, idx, x, f)
            } else {
                let nex = self.data.len();
                right = Some(nex);
                self.data.push((M::identity(), None, None));
                self.update_dfs(nex, m, r, idx, x, f)
            };
            M::op(&res_l, &res_r)
        };
        self.data[p] = (res, left, right);
        res
    }
    pub fn prod(&self, l: usize, r: usize)->M::S{
        self.prod_dfs(0, 0, self.n, l, r)
    }
    fn prod_dfs(&self, p: usize, l: usize, r: usize, x: usize, y: usize)->M::S{
        if r <= x||y <= l{return M::identity();}
        let (z, left, right) =self.data[p];
        if x <= l && r <= y{
            return z;
        }
        let m = (l+r)/2;
        let res_l = if let Some(ln) = left{
            self.prod_dfs(ln, l, m, x, y)
        } else {
            M::identity()
        };
        let res_r = if let Some(rn) = right{
            self.prod_dfs(rn, m, r, x, y)
        } else {
            M::identity()
        };
        M::op(&res_l, &res_r)
    }
    pub fn max_right<F>(&self, l: usize, f: F)->usize where F: Fn(&M::S)->bool{
        assert!(f(&M::identity()));
        if l==self.n{return self.n}
        let mut ac = M::identity();
        self.max_right_dfs(0, 0, self.n, l, &mut ac, &f)
    }
    fn max_right_dfs<F>(&self, p: usize, l: usize, r: usize, x: usize, ac: &mut M::S, f: &F)->usize where F: Fn(&M::S)->bool{
        if r <= x{
            return x
        }
        if l >= x{
            let res = M::op(ac, &self.data[p].0);
            if f(&res){
                *ac = res;
                return r;
            } else if r-l==1{
                return l;
            }
        }
        let m = (l+r)/2;
        let (_, left, right) = self.data[p];
        let ret = if let Some(ln) = left{
            self.max_right_dfs(ln, l, m, x, ac, f)
        } else {
            x
        };
        if ret < m{
            return ret;
        } else if let Some(rn) = right{
            self.max_right_dfs(rn, m, r, x, ac, f)
        } else {
            r
        }
    }
    pub fn min_left<F>(&self, r: usize, f: F)->usize where F: Fn(&M::S)->bool{
        assert!(f(&M::identity()));
        if r==0{return 0;}
        let mut ac = M::identity();
        self.min_left_dfs(0, 0, self.n, r, &mut ac, &f)
    }
    fn min_left_dfs<F>(&self, p: usize, l: usize, r: usize, x: usize, ac: &mut M::S, f: &F)->usize where F: Fn(&M::S)->bool{
        if x <= l{
            return l;
        } else if r <= x{
            let res = M::op(&self.data[p].0, ac);
            if f(&res){
                *ac = res;
                return l;
            } else if l+1==r{
                return r;
            }
        }
        let m = (l+r)/2;
        let (_, left, right) = self.data[p];
        let ret = if let Some(rn) = right{
            self.min_left_dfs(rn, m, r, x, ac, f)
        } else {
            m
        };
        if ret > m{
            ret
        } else if let Some(ln) = left{
            self.min_left_dfs(ln, l, m, x, ac, f)
        } else {
            l
        }
    }
    pub fn all_prod(&self)->M::S{
        self.data[0].0
    }
}
struct M;
impl SegTreeMonoid for M{
    type S = usize;
    fn identity() -> Self::S {
        0
    }
    fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
        a+b
    }
}
//use proconio::fastout;
//#[fastout]
fn main(){
    input!{
        n: usize,
        query: [(usize, usize, usize); n],
    }
    let mut segtree = DynamicSegmenttree::<M>::new(1000000001);
    let mut ans = 0;
    for &(p, x, y) in &query{
        if p==0{
            segtree.push(x, y);
        } else {
            let res = segtree.prod(x, y+1);
            ans += res;
        }
    }
    println!("{}", ans);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX