class Solution {
public:
    vector<int> colorTheArray(int n, vector<vector<int>>& queries) {
        int ans=0;
        int m=queries.size();
        vector<int> ret;
        vector<int> arr(n,0);
        for(int i=0;i<m;i++)
        {
            int x=queries[i][0];
            int y=queries[i][1];
            if(arr[x]==0)
            {
                if(x-1>=0&&arr[x-1]==y)
                  ++ans;
                if(x+1<n&&arr[x+1]==y)
                  ++ans;
            }
            else
            {
                int count=0;
                if(x-1>=0&&arr[x-1]==arr[x])
                   --ans;
                if(x+1<n&&arr[x]==arr[x+1])
                  --ans;
                if(x-1>=0&&arr[x-1]==y)
                  ++ans;
                if(x+1<n&&arr[x+1]==y)
                  ++ans;
            }
            arr[x]=y;
            ret.push_back(ans);
        }
        return ret;
    }
};