leetcode

0

1 #pragma GCC optimize("fast")

2 static auto _ = []() {

3 ios_base::sync_with_stdio(false);

4 cin.tie(nullptr);

5 cout.tie(nullptr);

6 return 0;

7 }();

8

9 class Solution {

10 public:

11 vector<int> sumEvenAfterQueries(vector<int> &nums, const vector<vector<int>> &queries) {

12 vector<int> res;

13 res.reserve(queries.size());

14 int sum = 0;

15 for (int n : nums)

16 if (n % 2 == 0) sum += n;

17 for (const auto q : queries) {

18 if (nums[q[1]] % 2 == 0) sum -= nums[q[1]];

19 nums[q[1]] += q[0];

20 if (nums[q[1]] % 2 == 0) sum += nums[q[1]];

21 res.push_back(sum);

22 }

23 return res;

24 }

25 };