Problem p02763 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...)                                                               \
  "\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x, y) debug() << pp(x) pp(y)
#define dg3(x, y, z) debug() << pp(x) pp(y) pp(z)
#define dg4(w, x, y, z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof x);
#define sz(x) (int)x.size()
template <typename T> void db(T x) { debug() << ">>> " << x; }
template <typename T> void db(T x, T y) {
  debug() << ">>> " << x << " , " << y;
}
template <typename T> void db(T x, T y, T z) {
  debug() << ">>> " << x << " , " << y << " , " << z;
}
template <typename T> void db(T x, T y, T z, T a) {
  debug() << ">>> " << x << " , " << y << " , " << z << " , " << a;
}
const int xx = 2e5 + 10;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;

int BIT[xx][30];

void update(int n, int id, int pos, int delta) {
  while (id <= n) {
    BIT[id][pos] += delta;
    id += (id & -id);
  }
}
int query(int id, int pos) {
  int sum = 0;
  while (id > 0) {
    sum += BIT[id][pos];
    id -= (id & -id);
  }
  return sum;
}

int getdis(int l, int r) {
  int ans = 0;
  for (int i = 0; i < 26; i++) {
    ans += (query(r, i) - query(l - 1, i)) > 0;
  }
  return ans;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  string s;
  cin >> s;
  int Q;
  cin >> Q;
  for (int i = 0; i < n; i++) {
    update(n, i + 1, s[i] - 'a', 1);
  }
  while (Q--) {
    int typ;
    db("---------------");
    dg1(s);
    cin >> typ;
    if (typ == 1) {
      int id;
      char ch;
      cin >> id >> ch;
      update(n, id, s[id - 1] - 'a', -1);
      update(n, id, ch - 'a', 1);
      s[id - 1] = ch;
    } else {
      int l, r;
      cin >> l >> r;
      int res = getdis(l, r);
      cout << res << '\n';
    }
    dg1(s);
  }
}

Fixed submission:
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define pp(...) "\033[94m [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define pp1(...)                                                               \
  "\033[1;47;35m" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "]\033[0m"
#define dg(x) debug() << pp1(x)
#define dg1(x) debug() << pp(x)
#define dg2(x, y) debug() << pp(x) pp(y)
#define dg3(x, y, z) debug() << pp(x) pp(y) pp(z)
#define dg4(w, x, y, z) debug() << pp(w) pp(x) pp(y) pp(z)
#define int long long
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof x);
#define sz(x) (int)x.size()
template <typename T> void db(T x) { debug() << ">>> " << x; }
template <typename T> void db(T x, T y) {
  debug() << ">>> " << x << " , " << y;
}
template <typename T> void db(T x, T y, T z) {
  debug() << ">>> " << x << " , " << y << " , " << z;
}
template <typename T> void db(T x, T y, T z, T a) {
  debug() << ">>> " << x << " , " << y << " , " << z << " , " << a;
}
const int xx = 5e5 + 10;
const int Mod = 1e9 + 7;
const int inf = 1e18;
const int Maxn = 20010;

int BIT[xx][30];

void update(int n, int id, int pos, int delta) {
  while (id <= n) {
    BIT[id][pos] += delta;
    id += (id & -id);
  }
}
int query(int id, int pos) {
  int sum = 0;
  while (id > 0) {
    sum += BIT[id][pos];
    id -= (id & -id);
  }
  return sum;
}

int getdis(int l, int r) {
  int ans = 0;
  for (int i = 0; i < 26; i++) {
    ans += (query(r, i) - query(l - 1, i)) > 0;
  }
  return ans;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  string s;
  cin >> s;
  int Q;
  cin >> Q;
  for (int i = 0; i < n; i++) {
    update(n, i + 1, s[i] - 'a', 1);
  }
  while (Q--) {
    int typ;
    db("---------------");
    dg1(s);
    cin >> typ;
    if (typ == 1) {
      int id;
      char ch;
      cin >> id >> ch;
      update(n, id, s[id - 1] - 'a', -1);
      update(n, id, ch - 'a', 1);
      s[id - 1] = ch;
    } else {
      int l, r;
      cin >> l >> r;
      int res = getdis(l, r);
      cout << res << '\n';
    }
    dg1(s);
  }
}