CF1679B.Stone Age Problem

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

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 aa of nn integers. You are also given qq queries of two types:

  • Replace ii -th element in the array with integer xx .
  • Replace each element in the array with integer xx .

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

输入格式

The first line contains two integers nn and qq ( 1n,q21051 \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 nn integers a1,,ana_1, \ldots, a_n ( 1ai1091 \le a_i \le 10^9 ) — elements of the array aa .

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

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

输出格式

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

输入输出样例

  • 输入#1

    5 5
    1 2 3 4 5
    1 1 5
    2 10
    1 5 11
    1 4 1
    2 1

    输出#1

    19
    50
    51
    42
    5

说明/提示

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

  1. Initial array is [1,2,3,4,5][1, 2, 3, 4, 5] .
  2. After performing the first query, array equals to [5,2,3,4,5][5, 2, 3, 4, 5] . The sum of all elements is 1919 .
  3. After performing the second query, array equals to [10,10,10,10,10][10, 10, 10, 10, 10] . The sum of all elements is 5050 .
  4. After performing the third query, array equals to [10,10,10,10,11[10, 10, 10, 10, 11 ]. The sum of all elements is 5151 .
  5. After performing the fourth query, array equals to [10,10,10,1,11][10, 10, 10, 1, 11] . The sum of all elements is 4242 .
  6. After performing the fifth query, array equals to [1,1,1,1,1][1, 1, 1, 1, 1] . The sum of all elements is 55 .
首页