aizu_online_judge/dsl/
dsl_2_f.rs1use competitive::prelude::*;
2use competitive::{algebra::RangeMinRangeUpdate, data_structure::LazySegmentTree};
3
4competitive::define_enum_scan! {
5 enum Query: usize {
6 0 => Update { s: usize, t: usize, x: i32 }
7 1 => Fold { s: usize, t: usize }
8 }
9}
10
11#[verify::aizu_online_judge("DSL_2_F")]
12pub fn dsl_2_f(reader: impl Read, writer: impl Write) {
13 prepare_io!(reader, writer);
14 sc!(n, q);
15 let mut seg = LazySegmentTree::<RangeMinRangeUpdate<_>>::new(n);
16 for _ in 0..q {
17 sc!(query: Query);
18 match query {
19 Query::Update { s, t, x } => {
20 seg.update(s..t + 1, Some(x));
21 }
22 Query::Fold { s, t } => {
23 pp!(seg.fold(s..t + 1));
24 }
25 }
26 }
27}