영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Your task is to maintain a list of arrays which initially has a single array. You have to process the following types of queries:
- Set the value a in array k to x.
- Calculate the sum of values in range [a,b] in array k.
- Create a copy of array k and add it to the end of the list.
Input
The first input line has two integers n and q: the array size and the number of queries.
The next line has n integers t_1,t_2,…,t_n: the initial contents of the array.
Finally, there are q lines describing the queries. The format of each line is one of the following: "1 k a x", "2 k a b" or "3 k".
Output
Print the answer to each sum query.
Constraints
- 1 ≤ n, q ≤ 2 · 10^5
- 1 ≤ t_i, x ≤ 10^9
- 1 ≤ a ≤ b ≤ n
예제
예제 1
5 6 2 3 1 2 5 3 1 2 1 1 5 2 2 1 5 1 2 2 5 2 1 1 5 2 2 1 5
13 13 13 15