8823: [yosupo] Data Structure - Point Add Range Sum
[Creator : ]
Description
You are given an integer sequence $a_0, a_1, ..., a_{N-1}$ with the length $N$.
Process the following $Q$ queries in order:
- 0 $p$ $x$: $a_p \gets a_p + x$
- 1 $l$ $r$: Print $\sum_{i = l}^{r - 1}{a_i}$
Process the following $Q$ queries in order:
- 0 $p$ $x$: $a_p \gets a_p + x$
- 1 $l$ $r$: Print $\sum_{i = l}^{r - 1}{a_i}$
Input
$N$ $Q$
$a_0$ $a_1$ ... $a_{N - 1}$
$\textrm{Query}_0$
$\textrm{Query}_1$
:
$\textrm{Query}_{Q - 1}$
$a_0$ $a_1$ ... $a_{N - 1}$
$\textrm{Query}_0$
$\textrm{Query}_1$
:
$\textrm{Query}_{Q - 1}$
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$
$0 \leq a_i, x \leq 10^9$
$0 \leq p < N$
$0 \leq l_i < r_i \leq N$
Sample 1 Input
5 5
1 2 3 4 5
1 0 5
1 2 4
0 3 10
1 0 5
1 0 3
Sample 1 Output
15
7
25
6