AtCoder ABC 157E Simple String Queries

  1 #pragma GCC optimize(2)
  2 #include <bits/stdc++.h>
  3 using namespace std;
  4 
  5 /*-------------------Define Start-------------------*/
  6 typedef bool BL;                        // 布尔类型
  7 typedef char SB;                        // 有符号1字节,8位
  8 typedef unsigned char UB;                // 无符号1字节,8位
  9 typedef short SW;                        // 有符号短整型,16位
 10 typedef unsigned short UW;                // 无符号短整型,16位
 11 typedef long SDW;                        // 有符号整型,32位
 12 typedef unsigned long UDW;               // 无符号整型,32位
 13 typedef long long SLL;                    // 有符号长整型,64位
 14 typedef unsigned long long ULL;            // 无符号长整型,64位
 15 typedef char CH;                        // 单个字符
 16 typedef float R32;                        // 单精度浮点数
 17 typedef double R64;                        // 双精度浮点数
 18 
 19 #define Rep(i, n) for (register SDW i = 0; i < (n); ++i)
 20 #define For(i, s, t) for (register SDW i = (s); i <= (t); ++i)
 21 #define rFor(i, t, s) for (register SDW i = (t); i >= (s); --i)
 22 #define foreach(i, c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
 23 #define ms0(a) memset(a,0,sizeof(a))
 24 #define msI(a) memset(a,0x7f,sizeof(a))
 25 #define LOWBIT(x) ((x)&(-x))
 26 
 27 #define MP make_pair
 28 #define PB push_back
 29 #define ft first
 30 #define sd second
 31 #define ALL(x) x.begin(),x.end()
 32 
 33 #define pr(x) cout << #x << " = " << x << "  "
 34 #define prln(x) cout << #x << " = " << x << endl
 35 
 36 #define lson l , mid , rt << 1 
 37 #define rson mid + 1 , r , rt << 1 | 1
 38 
 39 const ULL mod = 1e9 + 7;                //常用模数(可根据题目需要修改)
 40 const ULL inf = 0x7fffffff;                //用来表示无限大
 41 const ULL infLL = 0x7fffffffffffffffLL;    //用来表示无限大
 42 /*-------------------Define End-------------------*/
 43 
 44 const UDW maxN = 5e5 + 7;
 45 SDW N, Q;
 46 string S; 
 47 SDW ans;
 48 
 49 void output();
 50 
 51 SDW st[maxN << 2];
 52     
 53 inline void pushUp(SDW rt) {
 54     st[rt] = st[rt << 1] | st[rt << 1 | 1];
 55 }
 56 
 57 inline void build(SDW l, SDW r, SDW rt) {
 58     if(l >= r) {
 59         st[rt] = (1 << (S[r] - ‘a‘));
 60         return;
 61     }
 62     SDW mid = (l + r) >> 1;
 63     build(lson);
 64     build(rson);
 65     pushUp(rt);
 66 }
 67 
 68 // 单点更新 
 69 inline void update(SDW x, SDW y, SDW l, SDW r, SDW rt) {
 70     if(l >= r) {
 71         st[rt] = y;
 72         return;
 73     }
 74     SDW mid = (l + r) >> 1;
 75     if(x <= mid) update(x, y, lson);
 76     else update(x, y, rson);
 77     pushUp(rt);
 78 }
 79 
 80 // 区间查询 
 81 inline SDW query(SDW L, SDW R, SDW l, SDW r, SDW rt) {
 82     if(L <= l && r <= R) return st[rt];
 83     SDW ret = 0;
 84     SDW mid = (l + r) >> 1;
 85     
 86     if(L <= mid) ret |= query(L, R, lson);
 87     if(R > mid) ret |= query(L, R, rson);
 88     return ret;
 89 }
 90 
 91 void input(){
 92     cin >> N >> S >> Q;
 93     S = "#" + S;
 94     build(1, N, 1);
 95 }
 96 
 97 void solve(){
 98     SDW mode;
 99     
100     Rep(i, Q) {
101         cin >> mode;
102         if(mode == 1) {
103             SDW x;
104             CH y;
105             cin >> x >> y;
106             update(x, (1 << (y - ‘a‘)), 1, N, 1);
107         }
108         else if(mode == 2) {
109             SDW x, y;
110             cin >> x >> y;
111             ans = query(x, y, 1, N, 1);
112             ans = __builtin_popcount(ans);
113             output();
114         }
115     }
116 }
117 
118 void output(){
119     cout << ans << endl;
120 }
121 
122 int main() {
123     input();
124     solve();
125     return 0;
126 }