This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/2/DSL_2_A
use proconio::input;
use rust_procon_lib::data_structure::segment_tree::segment_tree::SegmentTree;
const INF: usize = (1 << 31) - 1;
fn main() {
input! {
n: usize,
q: usize,
}
let mut seg = SegmentTree::new(n, INF, |x, y| x.min(y));
seg.construct(&vec![INF; n]);
for _ in 0..q {
input! {
t: usize,
}
match t {
0 => {
input! {
i: usize,
x: usize,
}
seg.update(i, x);
}
1 => {
input! {
l: usize,
r: usize,
}
println!("{}", seg.prod(l, r + 1));
}
_ => unreachable!(),
}
}
}
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| Rust | 00_small_00.in |
|
5 ms | 2 MB |
| Rust | 00_small_01.in |
|
5 ms | 2 MB |
| Rust | 00_small_02.in |
|
5 ms | 2 MB |
| Rust | 00_small_03.in |
|
5 ms | 2 MB |
| Rust | 01_rand_00.in |
|
5 ms | 2 MB |
| Rust | 01_rand_01.in |
|
5 ms | 2 MB |
| Rust | 01_rand_02.in |
|
5 ms | 2 MB |
| Rust | 01_rand_03.in |
|
5 ms | 2 MB |
| Rust | 02_biased_00.in |
|
5 ms | 2 MB |
| Rust | 02_biased_01.in |
|
5 ms | 2 MB |
| Rust | 02_biased_02.in |
|
5 ms | 2 MB |
| Rust | 02_biased_03.in |
|
53 ms | 4 MB |
| Rust | 03_rand_00.in |
|
6 ms | 2 MB |
| Rust | 03_rand_01.in |
|
11 ms | 2 MB |
| Rust | 03_rand_02.in |
|
14 ms | 2 MB |
| Rust | 03_rand_03.in |
|
12 ms | 2 MB |
| Rust | 03_rand_04.in |
|
101 ms | 6 MB |
| Rust | 03_rand_05.in |
|
73 ms | 6 MB |
| Rust | 04_maximum_00.in |
|
99 ms | 6 MB |
| Rust | 04_maximum_01.in |
|
101 ms | 6 MB |