Problem p02599 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)

#define bit(n) (1LL << (n))

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, ini, end) v.begin() + ini, v.begin() + end

#define ret return 0;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)

using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
  lint x, y;
  xy() : x(0), y(0) {}
  xy(lint _x, lint _y) : x(_x), y(_y) {}
  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
  bool operator<(xy p) const {
    if (y == p.y)
      return x < p.x;
    return y < p.y;
  }
};
struct xyd {
  ld x, y;
  xyd() : x(0), y(0) {}
  xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
  vec2() {}
  vec2(lint n) : vector(n) {}
  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};

template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;
template <class Key, class Val> using hashmap = unordered_map<Key, Val>;
template <class Key> using hashset = unordered_set<Key>;

template <class It> constexpr typename It::value_type rmax(It begin, It end) {
  return *max_element(begin, end);
}

template <class T1, class T2> constexpr auto mmax(T1 arg1, T2 arg2) {
  using T = decltype(arg1 + arg2);
  return max(T(arg1), T(arg2));
}

template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
  return mmax(arg0, mmax(args...));
}

template <class It> constexpr typename It::value_type rmin(It begin, It end) {
  return *min_element(begin, end);
}

template <class T1, class T2> constexpr auto mmin(T1 arg1, T2 arg2) {
  using T = decltype(arg1 + arg2);
  return min(T(arg1), T(arg2));
}

template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
  return mmin(arg0, mmin(args...));
}

mt19937 mtrand((random_device())());

const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;

constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }

#if (__cplusplus < 201703L)

lint gcd(lint a, lint b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }

#endif

template <class T> struct nval {
  lint n; // counts
  T val;
  nval() : n(0){};
  nval(lint _n, T _val) : n(_n), val(_val){};
};

template <class It, class It2> auto spacel(It i, It2 end) {
  if (i + 1 == end) {
    return '\\n';
  } else {
    return ' ';
  }
}

ostream &setp(ostream &ost) {
  cout << setprecision(60) << fixed;
  return ost;
}

const ulint mod = 1000000007;
// const ulint mod = 998244353;
const ld eps = 0.0000001;

template <class It, class... T> void sort2(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p...](const val_t &a, const val_t &b) {
    bool neq[] = {(a.*p != b.*p)...};
    bool sg[] = {(a.*p < b.*p)...};

    rep(i, sizeof...(p)) if (neq[i]) return sg[i];
    return false;
  });
}

template <class T> struct SegTree {
  lint n;
  vector<T> t;
  T neutral;

  SegTree(lint _n, const T &_neutral) : neutral(_neutral) {
    n = 1;
    while (n < _n) {
      n *= 2;
    }
    rep(i, n) { t.resize(2 * n, neutral); }
  }

  using funcT = T(T val1, T val2);
  funcT *un;

  void update(lint i, const T &val) {
    i += n - 1;
    t[i] = val;
    while (i > 0) {
      i = (i - 1) / 2;
      t[i] = un(t[i * 2 + 1], t[i * 2 + 2]);
    }
  }

  T query_impl(lint a, lint b, lint k, lint l, lint r) {
    if (r <= a || b <= l)
      return neutral;
    if (a <= l && r <= b)
      return t[k];
    else {
      const T c1 = query_impl(a, b, 2 * k + 1, l, (l + r) / 2);
      const T c2 = query_impl(a, b, 2 * k + 2, (l + r) / 2, r);
      return un(c1, c2);
    }
  }

  T query(lint l, lint r) { return query_impl(l, r, 0, 0, n); }
};

template <class T, class Val> bool exist(const T &m, const Val &val) {
  return m.find(val) != m.end();
}

template <class It, class T> bool exist(It begin, It end, const T &val) {
  return find(begin, end, val) != end;
}

lint n, q;

struct Q {
  lint l, r, i;
};
Q p[500010];

lint c[500010];
lint ans[500010];
lint x[500010], xe[500010];

int main() {
  cin >> n >> q;
  rep(i, n) cin >> c[i];
  rep(i, q) cin >> p[i].l >> p[i].r;
  rep(i, q) {
    p[i].l--;
    p[i].i = i;
  }
  sort2(p, p + q, &Q::r);

  SegTree<lint> tr(n, 0);
  tr.un = [](lint a, lint b) { return a + b; };

  lint r = 0;
  rep(i, q) {
    while (r < n && r < p[i].r) {
      if (xe[c[r]]) {
        lint xx = x[c[r]];
        tr.update(xx, tr.query(xx, xx + 1) - 1);
        tr.update(r, tr.query(r, r + 1) + 1);
      } else {
        tr.update(r, 1);
        xe[c[r]] = 1;
      }
      x[c[r]] = r;
      r++;
    }
    ans[p[i].i] = tr.query(p[i].l, p[i].r);
  }

  rep(i, q) cout << ans[i] << endl;

  return 0;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define repr(i, n) for (lint i = n - 1; i >= 0; i--)
#define repi(i, ini, n) for (lint i = ini; i < n; i++)
#define repir(i, ini, n) for (lint i = n - 1; i >= ini; i--)
#define repb(i, start, end) for (lint i = start; i <= end; i++)
#define repbr(i, start, end) for (lint i = end; i >= start; i--)

#define bit(n) (1LL << (n))

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rg(v, ini, end) v.begin() + ini, v.begin() + end

#define ret return 0;
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)

using lint = long long;
using ulint = unsigned long long;
using ld = long double;
struct xy {
  lint x, y;
  xy() : x(0), y(0) {}
  xy(lint _x, lint _y) : x(_x), y(_y) {}
  xy operator+(const xy &p) const { return xy(x + p.x, y + p.y); }
  bool operator<(xy p) const {
    if (y == p.y)
      return x < p.x;
    return y < p.y;
  }
};
struct xyd {
  ld x, y;
  xyd() : x(0), y(0) {}
  xyd(long double _x, long double _y) : x(_x), y(_y) {}
};
using vec = vector<lint>;
using vecd = vector<ld>;
using vecs = vector<string>;
using vecp = vector<xy>;
template <class T> using vect = vector<T>;
class vec2 : public vector<vector<lint>> {
public:
  vec2() {}
  vec2(lint n) : vector(n) {}
  vec2(lint h, lint w) : vector(h, vector<lint>(w)) {}
  vec2(lint h, lint w, lint v) : vector(h, vector<lint>(w, v)) {}
};

template <class T> using priq = priority_queue<T>;
template <class T> using rpriq = priority_queue<T, vector<T>, greater<T>>;
template <class Key, class Val> using hashmap = unordered_map<Key, Val>;
template <class Key> using hashset = unordered_set<Key>;

template <class It> constexpr typename It::value_type rmax(It begin, It end) {
  return *max_element(begin, end);
}

template <class T1, class T2> constexpr auto mmax(T1 arg1, T2 arg2) {
  using T = decltype(arg1 + arg2);
  return max(T(arg1), T(arg2));
}

template <class T, class... Types> constexpr auto mmax(T arg0, Types... args) {
  return mmax(arg0, mmax(args...));
}

template <class It> constexpr typename It::value_type rmin(It begin, It end) {
  return *min_element(begin, end);
}

template <class T1, class T2> constexpr auto mmin(T1 arg1, T2 arg2) {
  using T = decltype(arg1 + arg2);
  return min(T(arg1), T(arg2));
}

template <class T, class... Types> constexpr auto mmin(T arg0, Types... args) {
  return mmin(arg0, mmin(args...));
}

mt19937 mtrand((random_device())());

const double pi = 3.141592653589793238462;
const lint intmax = 9223372036854775807;
const lint inf = 1100100100100100100LL;

constexpr lint div2(lint p, lint q) { return (p + q - 1) / q; }

#if (__cplusplus < 201703L)

lint gcd(lint a, lint b) {
  while (1) {
    if (a < b)
      swap(a, b);
    if (!b)
      break;
    a %= b;
  }
  return a;
}

lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }

#endif

template <class T> struct nval {
  lint n; // counts
  T val;
  nval() : n(0){};
  nval(lint _n, T _val) : n(_n), val(_val){};
};

template <class It, class It2> auto spacel(It i, It2 end) {
  if (i + 1 == end) {
    return '\\n';
  } else {
    return ' ';
  }
}

ostream &setp(ostream &ost) {
  cout << setprecision(60) << fixed;
  return ost;
}

const ulint mod = 1000000007;
// const ulint mod = 998244353;
const ld eps = 0.0000001;

template <class It, class... T> void sort2(It begin, It end, T... p) {
  using val_t = remove_reference_t<decltype(*begin)>;

  sort(begin, end, [p...](const val_t &a, const val_t &b) {
    bool neq[] = {(a.*p != b.*p)...};
    bool sg[] = {(a.*p < b.*p)...};

    rep(i, sizeof...(p)) if (neq[i]) return sg[i];
    return false;
  });
}

template <class T> struct SegTree {
  lint n;
  vector<T> t;
  T neutral;

  SegTree(lint _n, const T &_neutral) : neutral(_neutral) {
    n = 1;
    while (n < _n) {
      n *= 2;
    }
    rep(i, n) { t.resize(2 * n, neutral); }
  }

  using funcT = T(T val1, T val2);
  funcT *un;

  void update(lint i, const T &val) {
    i += n - 1;
    t[i] = val;
    while (i > 0) {
      i = (i - 1) / 2;
      t[i] = un(t[i * 2 + 1], t[i * 2 + 2]);
    }
  }

  T query_impl(lint a, lint b, lint k, lint l, lint r) {
    if (r <= a || b <= l)
      return neutral;
    if (a <= l && r <= b)
      return t[k];
    else {
      const T c1 = query_impl(a, b, 2 * k + 1, l, (l + r) / 2);
      const T c2 = query_impl(a, b, 2 * k + 2, (l + r) / 2, r);
      return un(c1, c2);
    }
  }

  T query(lint l, lint r) { return query_impl(l, r, 0, 0, n); }
};

template <class T, class Val> bool exist(const T &m, const Val &val) {
  return m.find(val) != m.end();
}

template <class It, class T> bool exist(It begin, It end, const T &val) {
  return find(begin, end, val) != end;
}

int main() {
  lint n, q;
  cin >> n >> q;
  vec c(n);
  rep(i, n) cin >> c[i];

  struct Q {
    lint l, r, i, ans;
  };
  vect<Q> p(q);
  rep(i, q) cin >> p[i].l >> p[i].r;
  rep(i, q) {
    p[i].l--;
    p[i].i = i;
  }
  sort2(all(p), &Q::r);

  SegTree<lint> tr(n, 0);
  tr.un = [](lint a, lint b) { return a + b; };

  hashmap<lint, lint> x;

  lint r = 0;
  rep(i, q) {
    while (r < n && r < p[i].r) {
      if (exist(x, c[r])) {
        lint xx = x[c[r]];
        tr.update(xx, tr.query(xx, xx + 1) - 1);
        tr.update(r, tr.query(r, r + 1) + 1);
      } else {
        tr.update(r, 1);
      }
      x[c[r]] = r;
      r++;
    }
    p[i].ans = tr.query(p[i].l, p[i].r);
  }

  sort2(all(p), &Q::i);

  rep(i, q) cout << p[i].ans << endl;

  return 0;
}