Codeforces Round 791 (Div. 2)
B
Stone Age Problem
Codeforces
1200
原题
← AC →
翻译中…

Once upon a time Mike and Mike decided to come up with an outstanding problem for some stage of ROI (rare olympiad in informatics). One of them came up with a problem prototype but another stole the idea and proposed that problem for another stage of the same olympiad. Since then the first Mike has been waiting for an opportunity to propose the original idea for some other contest... Mike waited until this moment!

翻译中…

You are given an array $a$ of $n$ integers. You are also given $q$ queries of two types:

翻译中…
  • Replace $i$-th element in the array with integer $x$.
  • Replace each element in the array with integer $x$.
翻译中…

After performing each query you have to calculate the sum of all elements in the array.

翻译中…

Input

翻译中…

The first line contains two integers $n$ and $q$ ($1 \le n, q \le 2 \cdot 10^5$) — the number of elements in the array and the number of queries, respectively.

翻译中…

The second line contains $n$ integers $a_1, \ldots, a_n$ ($1 \le a_i \le 10^9$) — elements of the array $a$.

翻译中…

Each of the following $q$ lines contains a description of the corresponding query. Description begins with integer $t$ ($t \in \{1, 2\}$) which denotes a type of the query:

翻译中…
  • If $t = 1$, then two integers $i$ and $x$ are following ($1 \le i \le n$, $1 \le x \le 10^9$) — position of replaced element and it's new value.
  • If $t = 2$, then integer $x$ is following ($1 \le x \le 10^9$) — new value of each element in the array.
翻译中…

Output

翻译中…

Print $q$ integers, each on a separate line. In the $i$-th line print the sum of all elements in the array after performing the first $i$ queries.

翻译中…

Note

翻译中…

Consider array from the example and the result of performing each query:

翻译中…
  1. Initial array is $[1, 2, 3, 4, 5]$.
  2. After performing the first query, array equals to $[5, 2, 3, 4, 5]$. The sum of all elements is $19$.
  3. After performing the second query, array equals to $[10, 10, 10, 10, 10]$. The sum of all elements is $50$.
  4. After performing the third query, array equals to $[10, 10, 10, 10, 11$]. The sum of all elements is $51$.
  5. After performing the fourth query, array equals to $[10, 10, 10, 1, 11]$. The sum of all elements is $42$.
  6. After performing the fifth query, array equals to $[1, 1, 1, 1, 1]$. The sum of all elements is $5$.
翻译中…

样例

Input #1
5 5
1 2 3 4 5
1 1 5
2 10
1 5 11
1 4 1
2 1
Output #1
19
50
51
42
5
InputCopy OutputCopy
题目信息
题号
1679B
时间限制
2 s
内存限制
256 MB
标签
数据结构
模拟

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。