This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/static_range_sum
use proconio::input;
use rust_procon_lib::data_structure::prefix_sum::prefix_sum::PrefixSum;
fn main() {
input! {
n: usize,
q: usize,
a: [usize; n],
}
let psum = PrefixSum::new(n, 0, |i| a[i]);
for _ in 0..q {
input! {
l: usize,
r: usize,
}
println!("{}", psum.query(l, r));
}
}
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| Rust | example_00 |
|
5 ms | 2 MB |
| Rust | max_random_00 |
|
449 ms | 21 MB |
| Rust | max_random_01 |
|
453 ms | 21 MB |
| Rust | max_random_02 |
|
459 ms | 21 MB |
| Rust | max_random_03 |
|
478 ms | 21 MB |
| Rust | max_random_04 |
|
449 ms | 21 MB |
| Rust | random_00 |
|
370 ms | 17 MB |
| Rust | random_01 |
|
400 ms | 19 MB |
| Rust | random_02 |
|
323 ms | 8 MB |
| Rust | random_03 |
|
57 ms | 13 MB |
| Rust | random_04 |
|
119 ms | 10 MB |