library_checker/data_structure/
range_add_range_min.rs1use competitive::prelude::*;
2#[doc(no_inline)]
3pub use competitive::{algebra::RangeMinRangeAdd, data_structure::LazySegmentTree};
4
5competitive::define_enum_scan! {
6 enum Query: u8 {
7 0 => Add { l: usize, r: usize, x: i64 }
8 1 => Min { l: usize, r: usize }
9 }
10}
11
12#[verify::library_checker("range_add_range_min")]
13pub fn range_add_range_min(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, a: [i64; n]);
17 let mut seg = LazySegmentTree::<RangeMinRangeAdd<i64>>::from_vec(a);
18 for _ in 0..q {
19 scan!(scanner, query: Query);
20 match query {
21 Query::Add { l, r, x } => {
22 seg.update(l..r, x);
23 }
24 Query::Min { l, r } => {
25 let ans = seg.fold(l..r);
26 writeln!(writer, "{}", ans).ok();
27 }
28 }
29 }
30}