Leetcode-985 Sum of Even Numbers After Queries(查询后的偶数和)

#define _for(i,a,b) for(int i = (a);i < (b);i ++)
#define pb push_back

class Solution
{
    public:
        vector<int> sumEvenAfterQueries(vector<int>& A, vector<vector<int>>& queries)
        {
            vector<int> rnt;
            int rntEle = 0;
            _for(i,0,A.size())
                if((A[i]&0x1)==0)
                    rntEle += A[i];
            for(int i = 0;i < queries.size();i ++)
            {
                if((A[queries[i][1]]&0x1) && ((A[queries[i][1]]+queries[i][0])&0x1))
                {
                    A[queries[i][1]] += queries[i][0];
                    rnt.pb(rntEle);
                }
                else if((A[queries[i][1]]&0x1)==0 && ((A[queries[i][1]]+queries[i][0])&0x1)==0)
                {
                    rntEle += queries[i][0];
                    A[queries[i][1]] += queries[i][0];
                    
                    rnt.pb(rntEle);
                }
                else if((A[queries[i][1]]&0x1) && ((A[queries[i][1]]+queries[i][0])&0x1)==0)
                {
                    rntEle += A[queries[i][1]]+queries[i][0];
                    A[queries[i][1]] += queries[i][0];
                    rnt.pb(rntEle);
                }
                else
                {
                    rntEle -= A[queries[i][1]];
                    A[queries[i][1]] += queries[i][0];
                    
                    rnt.pb(rntEle);
                }
                
            }
            return rnt;
        }
};