Problem:
Score : 100 points

Problem Statement

You are given an array a_0, a_1, ..., a_{N-1} of length N. Process Q queries of the following types.

0 p x: a_p \gets a_p + x

1 l r: Print \sum_{i = l}^{r - 1}{a_i}.

Constraints

1 \leq N, Q \leq 500,000

0 \leq a_i, x \leq 10^9

0 \leq p < N

0 \leq l_i < r_i \leq N

All values in Input are integer.

Input

Input is given from Standard Input in the following format:

N Q
a_0 a_1 ... a_{N - 1}
\textrm{Query}_0
\textrm{Query}_1
:
\textrm{Query}_{Q - 1}

Output

For each query of the latter type, print the answer.

Sample Input 1

5 5
1 2 3 4 5
1 0 5
1 2 4
0 3 10
1 0 5
1 0 3

Sample Output 1

15
7
25
6

Solution in Rust (1.42.0) (judge verdict: Accepted)

use std::str::FromStr;
use std::collections::{HashMap,HashSet,VecDeque,BinaryHeap};
use std::cmp::{max,min,Reverse,Ordering};
use std::time::{Duration, Instant};
use rand::Rng;
 
use proconio::input;
use proconio::marker::{Chars,Usize1,Isize1};

fn main() {
    input!{
        n:usize,
        q:usize,
        a:[usize;n],
        query:[(usize,usize,usize);q],
    }

    let mut T = FenwickTree::new(n,0);
    for (i,a) in a.iter().enumerate(){
        T.add(i, *a);
    }

    for (a,b,c) in query{
        if a==0{
            T.add(b, c);
        } else {
            println!("{}",T.sum(b,c));
        }
    }

}


struct FenwickTree<T> {
    n: usize,
    ary: Vec<T>,
    e: T,
}

impl<T: Clone + std::ops::AddAssign<T>> FenwickTree<T>{
    fn new(n: usize, e: T) -> Self{
        FenwickTree{
            n,
            ary:vec![e.clone(); n],
            e,
        }
    }
    fn accum(&self, mut idx: usize) -> T{
        let mut sum = self.e.clone();
        while idx > 0 {
            sum += self.ary[idx -1].clone();
            idx &= idx - 1;
        }
        sum
    }
    /// performs data[idx] += val.
    fn add<U: Clone>(&mut self, mut idx: usize, val: U)
    where
        T: std::ops::AddAssign<U>,
    {
        let n = self.n;
        idx += 1;
        while idx <= n{
            self.ary[idx -1] += val.clone();
            idx += idx & idx.wrapping_neg();
        }
    }
    /// returns data[l] + ... + data[r-1].
    fn sum(&self, l: usize, r: usize) -> T
    where
        T: std::ops::Sub<Output = T>,
    {
        self.accum(r) - self.accum(l)
    }
}