Submission #10440981

---

Source Code Expand

#include<bits/stdc++.h>
 
using namespace std;
set <int> q[26];
int n,op,x,l,r,t,len,cnt;
char s[500001]; 
char c;
 
 
int main(){
	int n;
	cin >> n;
	cin>>s;
	len=strlen(s);
	for (int i=0;i<len;i++) q[s[i]-97].insert(i);
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>op;
		if (op==1){
			cin>>x>>c;
			x--;
			q[s[x]-97].erase(x);
			s[x]=c;
			q[c-97].insert(x);
		}
		if (op==2){
			cin>>l>>r;
			l--;r--;
			cnt=0;
			for (int j=0;j<=25;j++) if (*q[j].lower_bound(l)<=r&&q[j].lower_bound(l)!=q[j].end()) cnt++;
			cout<<cnt<<endl;
		}
	}
}

Submission Info

Judge Result