GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

Sunday 16 October 2022

[Solution] Even-Odd Increments Codeforces Solution




B. Even-Odd Increments
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given n of integers a1,a2,,an. Process q queries of two types:

  • query of the form "xj": add the value xj to all even elements of the array a,
  • query of the form "xj": add the value xj to all odd elements of the array a.

Note that when processing the query, we look specifically at the odd/even value of ai, not its index.

After processing each query, print the sum of the elements of the array a.

Please note that the answer for some test cases won't fit into 32-bit integer type, so you should use at least 64-bit integer type in your programming language (like long long for C++).

Input

The first line of the input contains an integer t (1t104) — the number of test cases.

The descriptions of the test cases follow.

The first line of each test case contains two integers n and q (1nq105) — the length of array a and the number of queries.

The second line of each test case contains exactly n integers: a1,a2,,an (1ai109) — elements of the array a.

The following q lines contain queries as two integers typej and xj (0typej11xj104).

Solution Click Below:-  👉CLICK HERE👈
👇👇👇👇👇

It is guaranteed that the sum of values n over all test cases in a test does not exceed 105. Similarly, the sum of values q over all test cases does not exceed 105.

Output

For each test case, print q numbers: the sum of the elements of the array a after processing a query.


Note

In the first test case, the array a=[2] after the first query.

In the third test case, the array a is modified as follows: [1,3,2,4,10,48]  [7,9,2,4,10,48]  [7,9,7,9,15,53]  [7,9,7,9,15,53]  [10,12,10,12,18,56]  [22,24,22,24,30,68]  [23,25,23,25,31,69].

No comments:

Post a Comment