[Solution] Stone Age Problem Codeforces Solution | Codeforces Problem Solution 2022

[Solution] Stone Age Problem Codeforces Solution | Codeforces Problem Solution 2022

B. Stone Age Problem

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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$.

Solution Click Below:-  CLICK HERE

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≤𝑛,𝑞≤2⋅105$1\le n,q\le 2\cdot {10}^5$) — the number of elements in the array and the number of queries, respectively.

AvtoBus Codeforces Solution

Stone Age Problem Codeforces Solution

Rooks Defenders Codeforces Solution

Toss a Coin to Your Graph... Codeforces Solution

Typical Party in Dorm Codeforces Solution

Formalism for Formalism Codeforces Solution 

The second line contains 𝑛$n$ integers 𝑎1,…,𝑎𝑛$a_1,\dots ,a_n$ (1≤𝑎𝑖≤109$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$ (𝑡∈{1,2}$t\in \{1,2\}$) which denotes a type of the query:

• If 𝑡=1$t=1$, then two integers 𝑖$i$ and 𝑥$x$ are following (1≤𝑖≤𝑛$1\le i\le n$, 1≤𝑥≤109$1\le x\le {10}^9$) — position of replaced element and it's new value.
• If 𝑡=2$t=2$, then integer 𝑥$x$ is following (1≤𝑥≤109$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.

Join Now for Solution:-