aizu_online_judge/dsl/
dsl_2_d.rs

1use competitive::prelude::*;
2#[doc(no_inline)]
3pub use competitive::{algebra::RangeMinRangeUpdate, data_structure::LazySegmentTree};
4
5competitive::define_enum_scan! {
6    enum Query: usize {
7        0 => Update { s: usize, t: usize, x: i32 }
8        1 => Get { i: usize }
9    }
10}
11
12#[verify::aizu_online_judge("DSL_2_D")]
13pub fn dsl_2_d(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 = LazySegmentTree::<RangeMinRangeUpdate<_>>::new(n);
18    for _ in 0..q {
19        scan!(scanner, query: Query);
20        match query {
21            Query::Update { s, t, x } => {
22                seg.update(s..t + 1, Some(x));
23            }
24            Query::Get { i } => {
25                writeln!(writer, "{}", seg.fold(i..i + 1)).ok();
26            }
27        }
28    }
29}
aizu_online_judge/dsl/dsl_2_d.rs

aizu_online_judge/dsl/
dsl_2_d.rs
