线段树求组MLE

#include<bits/stdc++.h>
#include<bits/extc++.h>
#define ls id<<1
#define rs id<<1|1
using namespace __gnu_pbds;
using namespace std;
const int N=1e5+5;
int sum,n,Q,a[N];
struct node{
	gp_hash_table<int,int>t;
}Tree[270000];
void Qxiu(int l,int r,int left,int right,int id,int f){
	Tree[id].t[f]++;
	Tree[id].t[a[left]]--;
	if(left<=l&&r<=right){
		return;
	}
	int mid=l+r>>1;
	if(left<=mid)Qxiu(l,mid,left,right,ls,f);
	if(right>mid)Qxiu(mid+1,r,left,right,rs,f);
}
void Qzo(int l,int r,int left,int right,int id,int f){
	if(left<=l&&r<=right){
		sum+=Tree[id].t[f];
		return;
	}
	int mid=l+r>>1;
	if(left<=mid)Qzo(l,mid,left,right,ls,f);
	if(right>mid)Qzo(mid+1,r,left,right,rs,f);
}
signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>Q;
	for(int i=1;i<=n;i++){
		int X;
		cin>>X;
		Qxiu(1,n,i,i,1,X);
		a[i]=X;
	}
	while(Q--){
		char op;
		int l,r,k;
		sum=0;
		cin>>op>>l>>r;
		if(op=='Q'){
			cin>>k;
			Qzo(1,n,l,r,1,k);
			cout<<sum<<"\n";
		}
		else{
			Qxiu(1,n,l,l,1,r);
			a[l]=r;
		}
	}
	return 0;
}