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
//! セグメント木(関数を渡す)

use std::fmt::{self, Debug};
use std::ops::{
    Bound::{Excluded, Included, Unbounded},
    Deref, DerefMut, Index, RangeBounds,
};

/// SegmentTreeMut (Monoid)
/// - セグメント木
pub struct SegmentTreeMut<T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    pub size: usize,
    offset: usize,
    e: T,
    op: F,
    data: Vec<T>,
}

impl<T, F> Index<usize> for SegmentTreeMut<T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    type Output = T;
    fn index(&self, idx: usize) -> &Self::Output {
        &self.data[self.offset + idx]
    }
}

impl<T, F> SegmentTreeMut<T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    #[inline]
    fn parse_range<R: RangeBounds<usize>>(&self, range: R) -> Option<(usize, usize)> {
        let start = match range.start_bound() {
            Unbounded => 0,
            Excluded(&v) => v + 1,
            Included(&v) => v,
        }
        .min(self.size);
        let end = match range.end_bound() {
            Unbounded => self.size,
            Excluded(&v) => v,
            Included(&v) => v + 1,
        }
        .min(self.size);
        if start <= end {
            Some((start, end))
        } else {
            None
        }
    }

    /// セグメント木を初期化する
    pub fn new(n: usize, e: T, op: F) -> Self {
        let offset = n.next_power_of_two();

        Self {
            size: n,
            offset,
            e: e.clone(),
            op,
            data: vec![e; offset << 1],
        }
    }

    /// セグメント木を配列から初期化する
    pub fn build(src: &[T], e: T, op: F) -> Self {
        let mut seg = Self::new(src.len(), e, op);
        for (i, v) in src.iter().enumerate() {
            seg.data[seg.offset + i] = v.clone();
        }
        for i in (0..seg.offset).rev() {
            let lch = i << 1;
            seg.data[i] = (seg.op)(&seg.data[lch], &seg.data[lch + 1]);
        }
        seg
    }

    pub fn update(&mut self, index: usize, value: T) {
        let mut i = index + self.offset;
        self.data[i] = value;
        while i > 1 {
            i >>= 1;
            let lch = i << 1;
            self.data[i] = (self.op)(&self.data[lch], &self.data[lch + 1]);
        }
    }

    /// 可変な参照を返す
    pub fn get_mut(&mut self, i: usize) -> Option<ValMut<'_, T, F>> {
        if i < self.offset {
            let default = self.index(i).clone();
            Some(ValMut {
                segtree: self,
                idx: i,
                new_val: default,
            })
        } else {
            None
        }
    }

    /// 区間`range`の集約を行う
    pub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> T {
        let parsed = self.parse_range(range);
        if parsed.is_none() {
            return self.e.clone();
        }

        let (start, end) = parsed.unwrap();

        // 全体の値を取得
        if (start, end) == (0, self.size) {
            return self.data[1].clone();
        }

        // 値の取得
        let mut l = self.offset + start;
        let mut r = self.offset + end;
        let (mut res_l, mut res_r) = (self.e.clone(), self.e.clone());

        while l < r {
            if l & 1 == 1 {
                res_l = (self.op)(&res_l, &self.data[l]);
                l += 1;
            }
            if r & 1 == 1 {
                r -= 1;
                res_r = (self.op)(&self.data[r], &res_r);
            }
            l >>= 1;
            r >>= 1;
        }

        (self.op)(&res_l, &res_r)
    }
}

impl<T: Debug, F> std::fmt::Debug for SegmentTreeMut<T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "SegmentTreeMut {{ [").ok();
        for i in 0..self.size {
            if i + 1 < self.size {
                write!(f, "{:?}, ", self.data[self.offset + i]).ok();
            } else {
                write!(f, "{:?}", self.data[self.offset + i]).ok();
            }
        }
        write!(f, "] }}")
    }
}

pub struct ValMut<'a, T: 'a, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    segtree: &'a mut SegmentTreeMut<T, F>,
    idx: usize,
    new_val: T,
}

impl<T: Debug, F> fmt::Debug for ValMut<'_, T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        f.debug_tuple("ValMut")
            .field(&self.segtree.index(self.idx))
            .finish()
    }
}

impl<T, F> Drop for ValMut<'_, T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    fn drop(&mut self) {
        self.segtree.update(self.idx, self.new_val.clone());
    }
}

impl<T, F> Deref for ValMut<'_, T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    type Target = T;
    fn deref(&self) -> &Self::Target {
        &self.segtree[self.idx]
    }
}

impl<T, F> DerefMut for ValMut<'_, T, F>
where
    T: Debug + Clone + PartialEq,
    F: Fn(&T, &T) -> T,
{
    fn deref_mut(&mut self) -> &mut Self::Target {
        &mut self.new_val
    }
}