leetCode985

class Solution {
public:
    vector<int> sumEvenAfterQueries(vector<int>& A, vector<vector<int>>& queries) {
        int tmp = 0;
        vector<int>ans;
        
        for(int i = 0;i<A.size();i++)
        {
            if(A[i]%2 == 0) tmp += A[i];
        }
        for(int i = 0;i<queries.size();i++)
        {
            if(A[queries[i][1]]%2 == 0 && queries[i][0]%2 == 0) tmp += queries[i][0];
            else if(A[queries[i][1]]%2 != 0 && queries[i][0]%2 != 0) tmp += A[queries[i][1]] + queries[i][0];
            else if(A[queries[i][1]]%2 == 0) tmp -= A[queries[i][1]];
            A[queries[i][1]] += queries[i][0];
            ans.push_back(tmp);
        }
        return ans;
    }
};