#775637 (Rust) No.880 Yet Another Segment Tree Problem

• 問題: No.880 Yet Another Segment Tree Problem
• ユーザー: akakimidori
• 提出日時: 2022-07-02 12:21:11
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 208 ms / 5,000 ms
• コード長: 6,212 bytes
• コンパイル時間: 14,322 ms
• コンパイル使用メモリ: 381,108 KB
• 実行使用メモリ: 15,968 KB
• 最終ジャッジ日時: 2024-09-22 20:03:00
• 合計ジャッジ時間: 19,415 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 1
other	AC * 37

ソースコード

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
236
237
238
239
fn main() {
    let (a, ask) = read_input();
    let ini = a.iter().map(|a| Node::new(*a as u64)).collect::<Vec<_>>();
    let mut seg = SegmentTree::new(R, ini);
    use std::io::*;
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    for query in ask {
        match query {
            Query::Assign(l, r, v) => {
                let v = v as u64;
                seg.update(l, r, |node| node.set(v));
            }
            Query::Chgcd(l, r, v) => {
                let v = v as u64;
                seg.update_bool(l, r, |node| {
                    if v % node.lcm == 0 {
                        return true;
                    }
                    node.max * node.len == node.sum && {
                        node.set(binary_gcd(node.max, v));
                        true
                    }
                })
            }
            Query::Max(l, r) => {
                let mut ans = 0u64;
                seg.find(l, r, |node| ans = ans.max(node.max));
                writeln!(out, "{}", ans).ok();
            }
            Query::Sum(l, r) => {
                let mut ans = 0u64;
                seg.find(l, r, |node| ans += node.sum);
                writeln!(out, "{}", ans).ok();
            }
        }
    }
}
#[derive(Clone)]
struct Node {
    len: u64,
    sum: u64,
    max: u64,
    lcm: u64,
}
impl Node {
    fn new(a: u64) -> Self {
        Node {
            len: 1,
            sum: a,
            max: a,
            lcm: a,
        }
    }
    fn set(&mut self, v: u64) {
        self.sum = v * self.len;
        self.max = v;
        self.lcm = v;
    }
}
fn lcm(a: u64, b: u64) -> u64 {
    const INF: u64 = 1_000_000_001;
    if a == INF || b == INF {
        INF
    } else {
        INF.min(a / binary_gcd(a, b) * b)
    }
}
struct R;
impl DFSNode for R {
    type T = Node;
    fn merge(&self, p: &mut Self::T, c: &[Self::T]) {
        let (l, r) = (&c[0], &c[1]);
        p.len = l.len + r.len;
        p.sum = l.sum + r.sum;
        p.max = l.max.max(r.max);
        p.lcm = lcm(l.lcm, r.lcm);
    }
    fn push(&self, p: &mut Self::T, c: &mut [Self::T]) {
        if p.len * p.max == p.sum {
            let v = p.max;
            for c in c.iter_mut() {
                c.set(v);
            }
        }
    }
}
enum Query {
    Assign(usize, usize, u32),
    Chgcd(usize, usize, u32),
    Max(usize, usize),
    Sum(usize, usize),
}
fn read_input() -> (Vec<u32>, Vec<Query>) {
    let mut s = String::new();
    use std::io::*;
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace().flat_map(|s| s.parse::<usize>());
    let mut next = || it.next().unwrap();
    let n = next();
    let q = next();
    let a = (0..n).map(|_| next() as u32).collect();
    let ask = (0..q)
        .map(|_| {
            let op = next();
            let l = next() - 1;
            let r = next();
            match op {
                1 => {
                    let x = next() as u32;
                    Query::Assign(l, r, x)
                }
                2 => {
                    let x = next() as u32;
                    Query::Chgcd(l, r, x)
                }
                3 => Query::Max(l, r),
                _ => Query::Sum(l, r),
            }
        })
        .collect();
    (a, ask)
}
pub trait DFSNode {
    type T: Clone;
    fn merge(&self, p: &mut Self::T, c: &[Self::T]);
    fn push(&self, p: &mut Self::T, c: &mut [Self::T]);
}
pub struct SegmentTree<R: DFSNode> {
    op: R,
    data: Vec<R::T>,
    size: usize,
    n: usize,
}
impl<R: DFSNode> SegmentTree<R> {
    pub fn new(op: R, ini: Vec<R::T>) -> Self {
        assert!(ini.len() > 0);
        let n = ini.len();
        let size = n.next_power_of_two();
        let mut data = vec![ini[0].clone(); 2 * size];
        for (data, ini) in data[size..].iter_mut().zip(ini) {
            *data = ini;
        }
        for i in (1..size).rev() {
            let (f, t) = data.split_at_mut(2 * i);
            op.merge(&mut f[i], &t[..2]);
        }
        SegmentTree { op, data, size, n }
    }
    pub fn update<F>(&mut self, l: usize, r: usize, mut f: F)
    where
        F: FnMut(&mut R::T),
    {
        assert!(l <= r && r <= self.n);
        if l == r {
            return;
        }
        self.dfs(1, 0, self.size, l, r, true, &mut |node| {
            f(node);
            true
        });
    }
    pub fn update_bool<F>(&mut self, l: usize, r: usize, mut f: F)
    where
        F: FnMut(&mut R::T) -> bool,
    {
        assert!(l <= r && r <= self.n);
        if l == r {
            return;
        }
        self.dfs(1, 0, self.size, l, r, true, &mut f);
    }
    pub fn find<F>(&mut self, l: usize, r: usize, mut f: F)
    where
        F: FnMut(&R::T),
    {
        assert!(l <= r && r <= self.n);
        if l == r {
            return;
        }
        self.dfs(1, 0, self.size, l, r, false, &mut |node| {
            f(node);
            true
        });
    }
    fn dfs<F>(&mut self, v: usize, l: usize, r: usize, x: usize, y: usize, update: bool, f: &mut F)
    where
        F: FnMut(&mut R::T) -> bool,
    {
        if x <= l && r <= y && f(&mut self.data[v]) {
            return;
        }
        if r <= self.n {
            let (f, t) = self.data.split_at_mut(2 * v);
            self.op.push(&mut f[v], &mut t[..2]);
        }
        let m = (l + r) / 2;
        if x < m {
            self.dfs(2 * v, l, m, x, y, update, f);
        }
        if m < y {
            self.dfs(2 * v + 1, m, r, x, y, update, f);
        }
        if update && r <= self.n {
            let (f, t) = self.data.split_at_mut(2 * v);
            self.op.merge(&mut f[v], &t[..2]);
        }
    }
}
// ---------- begin binary_gcd ----------
pub fn binary_gcd(a: u64, b: u64) -> u64 {
    if a == 0 || b == 0 {
        return a + b;
    }
    let x = a.trailing_zeros();
    let y = b.trailing_zeros();
    let mut a = a >> x;
    let mut b = b >> y;
    while a != b {
        let x = (a ^ b).trailing_zeros();
        if a < b {
            std::mem::swap(&mut a, &mut b);
        }
        a = (a - b) >> x;
    }
    a << x.min(y)
}
// ---------- end binary_gcd ----------
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX