Problem p02599 (C++)

Buggy submission (status: Runtime Error):
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T>>;
#define REP(i, a, n) for (LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for (LL i = (LL)(n)-1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP                                                                \
  {                                                                            \
    cin.tie(NULL);                                                             \
    ios::sync_with_stdio(false);                                               \
  }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream &operator>>(istream &ist, pair<T, U> &right) {
  return ist >> right.first >> right.second;
}
template <class T, class U>
ostream &operator<<(ostream &ost, const pair<T, U> &right) {
  return ost << right.first << ' ' << right.second;
}
template <class T, class TCompatible, size_t N>
void Fill(T (&dest)[N], const TCompatible &val) {
  fill(dest, dest + N, val);
}
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T (&dest)[M][N], const TCompatible &val) {
  for (int i = 0; i < M; ++i)
    Fill(dest[i], val);
}
template <class T> T Next() {
  T buf;
  cin >> buf;
  return buf;
}
istream &Ignore(istream &ist) {
  string s;
  ist >> s;
  return ist;
}
bool Inside(int i, int j, int h, int w) {
  return i >= 0 && i < h && j >= 0 && j < w;
}

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BIT.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "FFT.h"
#include "Factorization.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "Interpolation.h"
#include "KDTree.h"
#include "LIS.h"
#include "LazySegmentTree.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream &operator>>(istream &ist, __int128 &val) {
  LL tmp;
  ist >> tmp;
  val = tmp;
  return ist;
}
ostream &operator<<(ostream &ost, __int128 val) {
  LL tmp = val;
  ost << tmp;
  return ost;
}
#endif

struct Query {
  int id;
  int l;
  int r;
};

const int B = 800;
const int MAX = 500000;
int n, q;
int c[MAX];
vector<Query> vs[(MAX - B + 1) / B];
int ans[MAX];
int cnts[MAX];
void sub(vector<Query> &v) {
  sort(v.begin(), v.end(), [](auto &&a, auto &&b) { return a.r < b.r; });

  int l = 0;
  int r = 0;
  Fill(cnts, 0);
  int cnt = 0;
  for (auto &&q : v) {
    if (q.r >= r) {
      while (r < q.r) {
        int x = c[r];
        if (!cnts[x])
          ++cnt;
        ++cnts[x];
        ++r;
      }
    } else {
      while (r > q.r) {
        --r;
        int x = c[r];
        --cnts[x];
        if (!cnts[x])
          --cnt;
      }
    }

    if (q.l >= l) {
      while (l < q.l) {
        int x = c[l];
        --cnts[x];
        if (!cnts[x])
          --cnt;
        ++l;
      }
    } else {
      while (l > q.l) {
        --l;
        int x = c[l];
        if (!cnts[x])
          ++cnt;
        ++cnts[x];
      }
    }

    ans[q.id] = cnt;
  }
}

int main() {
  cin >> n >> q;
  REP(i, 0, n) {
    scanf("%d", c + i);
    --c[i];
  }
  REP(k, 0, q) {
    int l, r;
    scanf("%d %d", &l, &r);
    --l;
    vs[l / B].emplace_back(Query{(int)k, l, r});
  }

  for (auto &&v : vs) {
    sub(v);
  }

  REP(k, 0, q) { printf("%d\n", ans[k]); }
  return 0;
}


Fixed submission:
#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;
using uint = uint32_t;
using LL = int64_t;
using ULL = uint64_t;
using PP = pair<LL, LL>;
template <typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T>>;
#define REP(i, a, n) for (LL i = (a), i##_max_ = (n); i < i##_max_; ++i)
#define REM(i, a, n) for (LL i = (LL)(n)-1, i##_min_ = (a); i >= i##_min_; --i)
#define FLOAT fixed << setprecision(16)
#define SPEEDUP                                                                \
  {                                                                            \
    cin.tie(NULL);                                                             \
    ios::sync_with_stdio(false);                                               \
  }
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream &operator>>(istream &ist, pair<T, U> &right) {
  return ist >> right.first >> right.second;
}
template <class T, class U>
ostream &operator<<(ostream &ost, const pair<T, U> &right) {
  return ost << right.first << ' ' << right.second;
}
template <class T, class TCompatible, size_t N>
void Fill(T (&dest)[N], const TCompatible &val) {
  fill(dest, dest + N, val);
}
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T (&dest)[M][N], const TCompatible &val) {
  for (int i = 0; i < M; ++i)
    Fill(dest[i], val);
}
template <class T> T Next() {
  T buf;
  cin >> buf;
  return buf;
}
istream &Ignore(istream &ist) {
  string s;
  ist >> s;
  return ist;
}
bool Inside(int i, int j, int h, int w) {
  return i >= 0 && i < h && j >= 0 && j < w;
}

#ifdef ONLY_MY_ENVIR
#include "Accumulator.h"
#include "Algebraic.h"
#include "BIT.h"
#include "BinaryMatrix.h"
#include "BinaryTree.h"
#include "Bipartite.h"
#include "Compressor.h"
#include "Decompositions.h"
#include "DiscreteLog.h"
#include "DynamicMod.h"
#include "Exponential.h"
#include "FFT.h"
#include "Factorization.h"
#include "FlowSolver.h"
#include "Geometric2D.h"
#include "Geometric2DFloat.h"
#include "Geometric3D.h"
#include "Geometric3DFloat.h"
#include "Graph.h"
#include "GraphUtil.h"
#include "IntMod.h"
#include "Interpolation.h"
#include "KDTree.h"
#include "LIS.h"
#include "LazySegmentTree.h"
#include "List.h"
#include "Math.h"
#include "MathUtil.h"
#include "Matrix.h"
#include "MinCostFlowSolver.h"
#include "MinMax.h"
#include "Numbers.h"
#include "Optimize.h"
#include "Permutation.h"
#include "Polynomial.h"
#include "Position.h"
#include "Random.h"
#include "Range.h"
#include "Rational.h"
#include "RuntimeMod.h"
#include "SegmentTree.h"
#include "SegmentTree2D.h"
#include "Sets.h"
#include "Shortest.h"
#include "SlidingWindow.h"
#include "SpanningTree.h"
#include "StringSearching.h"
#include "SuffixArray.h"
#include "SwitchList.h"
#include "Timer.h"
#include "Tree.h"
#include "TreeUtil.h"
#include "UnionFind.h"
#include "Util.h"
#include "VectorUtil.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream &operator>>(istream &ist, __int128 &val) {
  LL tmp;
  ist >> tmp;
  val = tmp;
  return ist;
}
ostream &operator<<(ostream &ost, __int128 val) {
  LL tmp = val;
  ost << tmp;
  return ost;
}
#endif

struct Query {
  int id;
  int l;
  int r;
};

const int B = 800;
const int MAX = 500000;
int n, q;
int c[MAX];
vector<Query> vs[(MAX + B - 1) / B];
int ans[MAX];
int cnts[MAX];
void sub(vector<Query> &v) {
  sort(v.begin(), v.end(), [](auto &&a, auto &&b) { return a.r < b.r; });

  int l = 0;
  int r = 0;
  Fill(cnts, 0);
  int cnt = 0;
  for (auto &&q : v) {
    if (q.r >= r) {
      while (r < q.r) {
        int x = c[r];
        if (!cnts[x])
          ++cnt;
        ++cnts[x];
        ++r;
      }
    } else {
      while (r > q.r) {
        --r;
        int x = c[r];
        --cnts[x];
        if (!cnts[x])
          --cnt;
      }
    }

    if (q.l >= l) {
      while (l < q.l) {
        int x = c[l];
        --cnts[x];
        if (!cnts[x])
          --cnt;
        ++l;
      }
    } else {
      while (l > q.l) {
        --l;
        int x = c[l];
        if (!cnts[x])
          ++cnt;
        ++cnts[x];
      }
    }

    ans[q.id] = cnt;
  }
}

int main() {
  cin >> n >> q;
  REP(i, 0, n) {
    scanf("%d", c + i);
    --c[i];
  }
  REP(k, 0, q) {
    int l, r;
    scanf("%d %d", &l, &r);
    --l;
    vs[l / B].emplace_back(Query{(int)k, l, r});
  }

  for (auto &&v : vs) {
    sub(v);
  }

  REP(k, 0, q) { printf("%d\n", ans[k]); }
  return 0;
}