1
class Solution {
2
  public int[] sumEvenAfterQueries(int[] nums, int[][] queries) {
3
    int sum = 0;
4
    for (int i : nums) {
5
      if ((i & 1) == 0) { // (i % 2 == 0)
6
        sum += i;
7
      }
8
    }
9
    int[] ans = new int[nums.length];
10
    int k = 0;
11
    for (int[] q : queries) {
12
      int idx = q[1];
13
      if ((nums[idx] & 1) == 0) { // (nums[idx] % 2 == 0)
14
        sum -= nums[idx];
15
      }
16
      nums[idx] += q[0];
17
      if ((nums[idx] & 1) == 0) { // (nums[idx] % 2 == 0)
18
        sum += nums[idx];
19
      }
20
      ans[k++] = sum;
21
    }
22
    return ans;
23
  }
24
}