leetcode/Problems/0985.cpp at master · DimitrijeDobrota/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

#pragma GCC optimize("fast")
static auto _ = []() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return 0;
}();

class Solution {
  public:
    vector<int> sumEvenAfterQueries(vector<int> &nums, const vector<vector<int>> &queries) {
        vector<int> res;
        res.reserve(queries.size());
        int sum = 0;
        for (int n : nums)
            if (n % 2 == 0) sum += n;
        for (const auto q : queries) {
            if (nums[q[1]] % 2 == 0) sum -= nums[q[1]];
            nums[q[1]] += q[0];
            if (nums[q[1]] % 2 == 0) sum += nums[q[1]];
            res.push_back(sum);
        }
        return res;
    }
};