Problem p02599 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

// [a -> b-1]
#define reps(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
// [0 -> a-1]
#define rep(i, a) reps(i, 0, (a))
// [a-1 -> b]
#define rreps(i, a, b) for (int i = (int)((a)-1); i >= (int)(b); i--)
// [a-1 -> 0]
#define rrep(i, a) rreps(i, a, 0)
#define all(v) (v).begin(), (v).end()
// next_permutation(all(v))
#define PERM(v) next_permutation(all(v))
/*sort(all(v));
 * (v).erase(unique(all(v)), v.end())*/
#define UNIQUE(v)                                                              \
  sort(all(v));                                                                \
  (v).erase(unique(all(v)), v.end())
// b is [a, c)
#define RANGE(a, b, c) ((a) <= (b) && (b) < (c))
// c is [a, e) && d is [b, f)
#define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f)))
#define chmin(a, b) a = min(a, (b))
#define chmax(a, b) a = max(a, (b))
#define fcout cout << fixed << setprecision(15)
#define YES(f) cout << ((f) ? YES_STR : NO_STR) << endl;

#ifdef LOCAL_DEBUG_OPTION
namespace debug_print_n {
struct DebugPrint {
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_integral<U>::value && !is_same<U, bool>::value &&
                     !is_same<U, char>::value>
  DUMP_SUB_FUNCTION(T x) {
    cerr << x;
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_same<U, bool>::value> DUMP_SUB_FUNCTION(T x) {
    if (x)
      cerr << "True";
    else
      cerr << "False";
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_same<U, char>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << '\'' << x << '\'';
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_same<U, string>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << '\"' << x << '\"';
  }
  template <class T>
  static enable_if_t<is_same<T, const char *>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << string(x);
  }
  template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(vector<T> x) {
    cerr << '{';
    for (size_t i = 0; i < x.size(); i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(x[i]);
    }
    cerr << '}';
  }
  template <class T, size_t N>
  static enable_if_t<true> DUMP_SUB_FUNCTION(array<T, N> x) {
    cerr << '{';
    for (size_t i = 0; i < x.size(); i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(x[i]);
    }
    cerr << '}';
  }
  template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(set<T> x) {
    cerr << '[';
    size_t i = 0;
    for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(*itr);
    }
    cerr << ']';
  }
  template <class T, class U>
  static enable_if_t<true> DUMP_SUB_FUNCTION(map<T, U> x) {
    cerr << '[';
    size_t i = 0;
    for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(itr->first);
      cerr << " : ";
      DUMP_SUB_FUNCTION(itr->second);
    }
    cerr << ']';
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_floating_point<U>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << fixed << setprecision(5) << x;
  }
  template <class T, class U>
  static enable_if_t<true> DUMP_SUB_FUNCTION(pair<T, U> p) {
    cerr << '(';
    DUMP_SUB_FUNCTION(p.first);
    cerr << ", ";
    DUMP_SUB_FUNCTION(p.second);
    cerr << ')';
  }
  template <int num = 0, class... Args>
  static enable_if_t<num == sizeof...(Args)>
  DUMP_SUB_FUNCTION(tuple<Args...> t) {
    if (num)
      cerr << ')';
  }
  template <int num = 0, class... Args>
      static enable_if_t <
      num<sizeof...(Args)> DUMP_SUB_FUNCTION(tuple<Args...> t) {
    if (num == 0)
      cerr << '(';
    DUMP_SUB_FUNCTION(get<num>(t));
    if (num + 1 < sizeof...(Args))
      cerr << ", ";
    DUMP_SUB_FUNCTION<num + 1>(t);
  }
  template <long unsigned N>
  static enable_if_t<true> DUMP_SUB_FUNCTION(bitset<N> x) {
    cerr << x;
  }
};
void dump() { cerr << endl; }
template <class Head, class... Tail> void dump(Head &&head, Tail &&...tail) {
  DebugPrint::DUMP_SUB_FUNCTION(head);
  if (sizeof...(Tail) != 0) {
    cerr << ' ';
  }
  dump(forward<Tail>(tail)...);
}
} // namespace debug_print_n
using debug_print_n::dump;
#else
template <class... Args> void dump(Args &&...args) {}
#endif

namespace bit {
using u32 = uint_fast32_t;
using u64 = unsigned long long;
template <class T> constexpr T set(T bin, u32 pos) {
  return bin | (1ull << pos);
}
template <class T> constexpr T unset(T bin, u32 pos) {
  return bin & ~(1ull << pos);
}
template <class T> constexpr T get(T bin, u32 pos) {
  return bin & (1ull << pos);
}
template <class T> constexpr bool check(T bin, u32 pos) {
  return get(bin, pos);
}
constexpr u32 popcount(u64 bin) { return __builtin_popcountll(bin); }
} // namespace bit

/**
 * @title BIT (Binary Indexed Tree)
 * @brief 0-indexed 半開区間で扱う。フェニック木 (Fenwick Tree) とも呼ばれる。
 */
template <class T> struct BIT {
  int n;
  vector<T> bit;
  // @brief 長さ N で初期化 O(N)$
  BIT(int n_) : n(n_), bit(n) {}
  // @brief vector で初期化 O(N)$
  BIT(const vector<T> &v) : n(v.size()), bit(v) {
    for (int i = 0; i < n - 1; i++)
      if ((i | (i + 1)) < n)
        bit[i | (i + 1)] += bit[i];
  }
  // @brief i 番目の要素に v を足す O(\log N)$
  // 0-indexed
  void add(int i, T v) {
    for (; i < n; i |= i + 1)
      bit[i] += v;
  }
  // @brief [0, i) の区間の和 の計算 O(\log N)$
  // 0-indexed 半開区間
  T get(int i) {
    T res = 0;
    for (i--; i >= 0; i = (i & (i + 1)) - 1)
      res += bit[i];
    return res;
  }
  // @brief [i, j) の区間の和 の計算 O(\log N)$
  // 0-indexed 半開区間
  T get(int i, int j) { return get(j) - get(i); }
};

signed main() {
  int N, Q;
  cin >> N >> Q;
  vector<tuple<int, int, int>> LR;
  vector<unsigned int> c(N);
  rep(i, N) cin >> c[i], c[i]--;
  rep(i, Q) {
    int l, r;
    cin >> l >> r;
    l--;
    LR.emplace_back(l, r, i);
  }
  sort(all(LR), [](auto &a, auto &b) { return get<1>(a) < get<1>(b); });
  vector<int> LA(N, -1);
  vector<int> res(N);
  BIT<int> B(N);
  int r = 0;
  for (auto [L, R, I] : LR) {
    while (r < R) {
      if (LA[c[r]] >= 0)
        B.add(LA[c[r]], -1);
      LA[c[r]] = r;
      B.add(r, 1);
      r++;
    }
    res[I] = B.get(L, R);
  }
  rep(i, Q) { cout << res[i] << endl; }
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

// [a -> b-1]
#define reps(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
// [0 -> a-1]
#define rep(i, a) reps(i, 0, (a))
// [a-1 -> b]
#define rreps(i, a, b) for (int i = (int)((a)-1); i >= (int)(b); i--)
// [a-1 -> 0]
#define rrep(i, a) rreps(i, a, 0)
#define all(v) (v).begin(), (v).end()
// next_permutation(all(v))
#define PERM(v) next_permutation(all(v))
/*sort(all(v));
 * (v).erase(unique(all(v)), v.end())*/
#define UNIQUE(v)                                                              \
  sort(all(v));                                                                \
  (v).erase(unique(all(v)), v.end())
// b is [a, c)
#define RANGE(a, b, c) ((a) <= (b) && (b) < (c))
// c is [a, e) && d is [b, f)
#define RANGE2D(a, b, c, d, e, f) (RANGE((a), (c), (e)) && RANGE((b), (d), (f)))
#define chmin(a, b) a = min(a, (b))
#define chmax(a, b) a = max(a, (b))
#define fcout cout << fixed << setprecision(15)
#define YES(f) cout << ((f) ? YES_STR : NO_STR) << endl;

#ifdef LOCAL_DEBUG_OPTION
namespace debug_print_n {
struct DebugPrint {
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_integral<U>::value && !is_same<U, bool>::value &&
                     !is_same<U, char>::value>
  DUMP_SUB_FUNCTION(T x) {
    cerr << x;
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_same<U, bool>::value> DUMP_SUB_FUNCTION(T x) {
    if (x)
      cerr << "True";
    else
      cerr << "False";
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_same<U, char>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << '\'' << x << '\'';
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_same<U, string>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << '\"' << x << '\"';
  }
  template <class T>
  static enable_if_t<is_same<T, const char *>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << string(x);
  }
  template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(vector<T> x) {
    cerr << '{';
    for (size_t i = 0; i < x.size(); i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(x[i]);
    }
    cerr << '}';
  }
  template <class T, size_t N>
  static enable_if_t<true> DUMP_SUB_FUNCTION(array<T, N> x) {
    cerr << '{';
    for (size_t i = 0; i < x.size(); i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(x[i]);
    }
    cerr << '}';
  }
  template <class T> static enable_if_t<true> DUMP_SUB_FUNCTION(set<T> x) {
    cerr << '[';
    size_t i = 0;
    for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(*itr);
    }
    cerr << ']';
  }
  template <class T, class U>
  static enable_if_t<true> DUMP_SUB_FUNCTION(map<T, U> x) {
    cerr << '[';
    size_t i = 0;
    for (auto itr = x.begin(); itr != x.end(); itr++, i++) {
      if (i)
        cerr << ", ";
      DUMP_SUB_FUNCTION(itr->first);
      cerr << " : ";
      DUMP_SUB_FUNCTION(itr->second);
    }
    cerr << ']';
  }
  template <class T, class U = remove_const_t<remove_reference_t<T>>>
  static enable_if_t<is_floating_point<U>::value> DUMP_SUB_FUNCTION(T x) {
    cerr << fixed << setprecision(5) << x;
  }
  template <class T, class U>
  static enable_if_t<true> DUMP_SUB_FUNCTION(pair<T, U> p) {
    cerr << '(';
    DUMP_SUB_FUNCTION(p.first);
    cerr << ", ";
    DUMP_SUB_FUNCTION(p.second);
    cerr << ')';
  }
  template <int num = 0, class... Args>
  static enable_if_t<num == sizeof...(Args)>
  DUMP_SUB_FUNCTION(tuple<Args...> t) {
    if (num)
      cerr << ')';
  }
  template <int num = 0, class... Args>
      static enable_if_t <
      num<sizeof...(Args)> DUMP_SUB_FUNCTION(tuple<Args...> t) {
    if (num == 0)
      cerr << '(';
    DUMP_SUB_FUNCTION(get<num>(t));
    if (num + 1 < sizeof...(Args))
      cerr << ", ";
    DUMP_SUB_FUNCTION<num + 1>(t);
  }
  template <long unsigned N>
  static enable_if_t<true> DUMP_SUB_FUNCTION(bitset<N> x) {
    cerr << x;
  }
};
void dump() { cerr << endl; }
template <class Head, class... Tail> void dump(Head &&head, Tail &&...tail) {
  DebugPrint::DUMP_SUB_FUNCTION(head);
  if (sizeof...(Tail) != 0) {
    cerr << ' ';
  }
  dump(forward<Tail>(tail)...);
}
} // namespace debug_print_n
using debug_print_n::dump;
#else
template <class... Args> void dump(Args &&...args) {}
#endif

namespace bit {
using u32 = uint_fast32_t;
using u64 = unsigned long long;
template <class T> constexpr T set(T bin, u32 pos) {
  return bin | (1ull << pos);
}
template <class T> constexpr T unset(T bin, u32 pos) {
  return bin & ~(1ull << pos);
}
template <class T> constexpr T get(T bin, u32 pos) {
  return bin & (1ull << pos);
}
template <class T> constexpr bool check(T bin, u32 pos) {
  return get(bin, pos);
}
constexpr u32 popcount(u64 bin) { return __builtin_popcountll(bin); }
} // namespace bit

/**
 * @title BIT (Binary Indexed Tree)
 * @brief 0-indexed 半開区間で扱う。フェニック木 (Fenwick Tree) とも呼ばれる。
 */
template <class T> struct BIT {
  int n;
  vector<T> bit;
  // @brief 長さ N で初期化 O(N)$
  BIT(int n_) : n(n_), bit(n) {}
  // @brief vector で初期化 O(N)$
  BIT(const vector<T> &v) : n(v.size()), bit(v) {
    for (int i = 0; i < n - 1; i++)
      if ((i | (i + 1)) < n)
        bit[i | (i + 1)] += bit[i];
  }
  // @brief i 番目の要素に v を足す O(\log N)$
  // 0-indexed
  void add(int i, T v) {
    for (; i < n; i |= i + 1)
      bit[i] += v;
  }
  // @brief [0, i) の区間の和 の計算 O(\log N)$
  // 0-indexed 半開区間
  T get(int i) {
    T res = 0;
    for (i--; i >= 0; i = (i & (i + 1)) - 1)
      res += bit[i];
    return res;
  }
  // @brief [i, j) の区間の和 の計算 O(\log N)$
  // 0-indexed 半開区間
  T get(int i, int j) { return get(j) - get(i); }
};

signed main() {
  int N, Q;
  cin >> N >> Q;
  vector<tuple<int, int, int>> LR;
  vector<unsigned int> c(N);
  rep(i, N) cin >> c[i], c[i]--;
  rep(i, Q) {
    int l, r;
    cin >> l >> r;
    l--;
    LR.emplace_back(l, r, i);
  }
  sort(all(LR), [](auto &a, auto &b) { return get<1>(a) < get<1>(b); });
  vector<int> LA(N, -1);
  vector<int> res(Q);
  BIT<int> B(N);
  int r = 0;
  for (auto [L, R, I] : LR) {
    while (r < R) {
      if (LA[c[r]] >= 0)
        B.add(LA[c[r]], -1);
      LA[c[r]] = r;
      B.add(r, 1);
      r++;
    }
    res[I] = B.get(L, R);
  }
  rep(i, Q) { cout << res[i] << endl; }
}