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