Problem p02599 (C++) — buggy submission, verdict: Runtime Error

#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
#define _overload3(_1, _2, _3, name, ...) name
#define _rep2(i, n) for (ll i = 0; i < (n); ++i)
#define _rep3(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2)(__VA_ARGS__)
#define _repe2(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define _repe3(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define repe(...) _overload3(__VA_ARGS__, _repe3, _repe2)(__VA_ARGS__)
#define _rrep2(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)
#define rrep(...) _overload3(__VA_ARGS__, _rrep3, _rrep2)(__VA_ARGS__)
#define _rrepe2(i, n) for (ll i = (ll)(n); i >= 0; i--)
#define _rrepe3(i, a, b) for (ll i = (ll)(b); i >= (ll)(a); i--)
#define rrepe(...) _overload3(__VA_ARGS__, _rrepe3, _rrepe2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

ll N;
ll Q;
vl c;
vl l;
vl r;

void solve();

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cin >> N;
  cin >> Q;
  c = vl(N);
  for (int i = 0; i < N; ++i) {
    cin >> c[i];
  }
  l = vl(Q);
  r = vl(Q);
  for (int i = 0; i < Q; ++i) {
    cin >> l[i];
    cin >> r[i];
  }
  solve();
}

// 1<= N,Q <= 5 × 10^5
// 1<= c_i <= N
// 1<= l_i <= r_i <= N
// 入力はすべて整数である。

#ifndef TEMPLATE_USED
#include "../template/template.hpp"
#endif

struct BinaryIndexedTree {
  int sz;
  vector<ll> data;

  BinaryIndexedTree(int sz) : sz(sz) { data.assign(sz, 0); }

  void add(int x, ll val) {
    while (x < sz)
      data[x] += val, x |= x + 1;
  }

  ll sum(int to) {
    to = min(to, sz - 1);
    ll ret = 0;
    while (to >= 0)
      ret += data[to], to = (to & (to + 1)) - 1;
    return ret;
  }

  ll sum(int from, int to) {
    if (from > to)
      return 0;
    return sum(to) - sum(from - 1);
  }
};

// ll N, ll Q, vl c, vl l, vl r
// Q 行出力せよ。i 行目には、i 番目のクエリに対する答えを出力せよ。
void solve() {
  rep(i, N) c[i]--;
  rep(i, Q) l[i]--, r[i]--;

  vvl qs(N);
  rep(i, Q) qs[r[i]].push_back(i);

  BinaryIndexedTree bit(N + 5);
  vl ans(Q);
  vl pos(N, -1);
  rep(i, N) {
    ll old_pos = pos[c[i]];
    if (old_pos != -1)
      bit.add(old_pos, -1);
    bit.add(i, 1);
    pos[c[i]] = i;

    for (ll j : qs[i]) {
      ans[j] = bit.sum(l[j], r[j]);
    }
  }
  rep(i, Q) cout << ans[i] << endl;
}


Error: 0

Fixed submission:

#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
const ll D4[] = {0, 1, 0, -1, 0};
const ll D8[] = {0, 1, 1, 0, -1, -1, 1, -1, 0};
#define _overload3(_1, _2, _3, name, ...) name
#define _rep2(i, n) for (ll i = 0; i < (n); ++i)
#define _rep3(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2)(__VA_ARGS__)
#define _repe2(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define _repe3(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); ++i)
#define repe(...) _overload3(__VA_ARGS__, _repe3, _repe2)(__VA_ARGS__)
#define _rrep2(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (ll)(b)-1; i >= (ll)(a); i--)
#define rrep(...) _overload3(__VA_ARGS__, _rrep3, _rrep2)(__VA_ARGS__)
#define _rrepe2(i, n) for (ll i = (ll)(n); i >= 0; i--)
#define _rrepe3(i, a, b) for (ll i = (ll)(b); i >= (ll)(a); i--)
#define rrepe(...) _overload3(__VA_ARGS__, _rrepe3, _rrepe2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

ll N;
ll Q;
vl c;
vl l;
vl r;

void solve();

int main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cin >> N;
  cin >> Q;
  c = vl(N);
  for (int i = 0; i < N; ++i) {
    cin >> c[i];
  }
  l = vl(Q);
  r = vl(Q);
  for (int i = 0; i < Q; ++i) {
    cin >> l[i];
    cin >> r[i];
  }
  solve();
}

// 1<= N,Q <= 5 × 10^5
// 1<= c_i <= N
// 1<= l_i <= r_i <= N
// 入力はすべて整数である。

#ifndef TEMPLATE_USED
#include "../template/template.hpp"
#endif

struct BinaryIndexedTree {
  int sz;
  vector<ll> data;

  BinaryIndexedTree(int sz) : sz(sz) { data.assign(sz, 0); }

  void add(int x, ll val) {
    while (x < sz)
      data[x] += val, x |= x + 1;
  }

  ll sum(int to) {
    to = min(to, sz - 1);
    ll ret = 0;
    while (to >= 0)
      ret += data[to], to = (to & (to + 1)) - 1;
    return ret;
  }

  ll sum(int from, int to) {
    if (from > to)
      return 0;
    return sum(to) - sum(from - 1);
  }
};

// ll N, ll Q, vl c, vl l, vl r
// Q 行出力せよ。i 行目には、i 番目のクエリに対する答えを出力せよ。
void solve() {
  rep(i, N) c[i]--;
  rep(i, Q) l[i]--, r[i]--;

  vvl qs(N);
  rep(i, Q) qs[r[i]].push_back(i);

  BinaryIndexedTree bit(N + 5);
  vl ans(N);
  vl pos(N, -1);
  rep(i, N) {
    ll old_pos = pos[c[i]];
    if (old_pos != -1)
      bit.add(old_pos, -1);
    bit.add(i, 1);
    pos[c[i]] = i;

    rep(k, qs[i].size()) {
      ll j = qs[i][k];
      ans[j] = bit.sum(l[j], r[j]);
    }
  }
  rep(i, Q) cout << ans[i] << endl;
}