aizu_online_judge/dsl/
dsl_2_a.rs

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

aizu_online_judge/dsl/
dsl_2_a.rs
