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

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int MAX = 1000001;

// structure to store queries
struct Query {
  ll l, r, idx;
};

// cmp function to sort queries according to r
bool cmp(Query x, Query y) { return x.r < y.r; }

// updating the bit array
void update(ll idx, ll val, ll bit[], ll n) {
  for (; idx <= n; idx += idx & -idx)
    bit[idx] += val;
}

// querying the bit array
ll query(ll idx, ll bit[], ll n) {
  ll sum = 0;
  for (; idx > 0; idx -= idx & -idx)
    sum += bit[idx];
  return sum;
}

void answeringQueries(ll arr[], ll n, Query queries[], ll q) {
  // initialising bit array
  ll bit[n + 1];
  memset(bit, 0, sizeof(bit));

  // holds the rightmost index of any number
  // as numbers of a[i] are less than or equal to 10^6
  ll last_visit[MAX];
  memset(last_visit, -1, sizeof(last_visit));

  // answer for each query
  ll ans[q];
  ll query_counter = 0;
  for (ll i = 0; i < n; i++) {
    // If last visit is not -1 update -1 at the
    // idx equal to last_visit[arr[i]]
    if (last_visit[arr[i]] != -1)
      update(last_visit[arr[i]] + 1, -1, bit, n);

    // Setting last_visit[arr[i]] as i and updating
    // the bit array accordingly
    last_visit[arr[i]] = i;
    update(i + 1, 1, bit, n);

    // If i is equal to r of any query  store answer
    // for that query in ans[]
    while (query_counter < q && queries[query_counter].r == i) {
      ans[queries[query_counter].idx] =
          query(queries[query_counter].r + 1, bit, n) -
          query(queries[query_counter].l, bit, n);
      query_counter++;
    }
  }

  // print answer for each query
  for (ll i = 0; i < q; i++)
    cout << ans[i] << endl;
}

// driver code
int main() {
  ll n, q, x, y;
  cin >> n >> q;
  ll a[n];

  for (ll i = 0; i < n; i++)
    cin >> a[i];

  Query queries[q + 1];

  for (ll i = 0; i < q; i++) {
    cin >> x >> y;
    queries[i].l = x - 1;
    queries[i].r = y - 1;
    queries[i].idx = i;
  }

  sort(queries, queries + q, cmp);
  answeringQueries(a, n, queries, q);

  return 0;
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

// Each segment of the segment tree would be a set
// to maintain distinct elements
set<ll> *segment;

// Build the segment tree
// i denotes current node, s denotes start and
// e denotes the end of range for current node
void build(ll i, ll s, ll e, ll arr[]) {

  // If start is equal to end then
  // insert the array element
  if (s == e) {
    segment[i].insert(arr[s]);
    return;
  }

  // Else divide the range into two halves
  // (start to mid) and (mid+1 to end)
  // first half will be the left node
  // and the second half will be the right node
  build(2 * i, s, (s + e) / 2, arr);
  build(1 + 2 * i, 1 + (s + e) / 2, e, arr);

  // Insert the sets of right and left
  // node of the segment tree
  segment[i].insert(segment[2 * i].begin(), segment[2 * i].end());

  segment[i].insert(segment[2 * i + 1].begin(), segment[2 * i + 1].end());
}

// Query in an range a to b
set<ll> query(ll node, ll l, ll r, ll a, ll b) {
  set<ll> left, right, result;

  // If the range is out of the bounds
  // of this segment
  if (b < l || a > r)
    return result;

  // If the range lies in this segment
  if (a <= l && r <= b)
    return segment[node];

  // Else query for the right and left
  // leaf node of this subtree
  // and insert them into the set
  left = query(2 * node, l, (l + r) / 2, a, b);
  result.insert(left.begin(), left.end());

  right = query(1 + 2 * node, 1 + (l + r) / 2, r, a, b);
  result.insert(right.begin(), right.end());

  // Return the result
  return result;
}

// Initialize the segment tree
void init(ll n) {
  // Get the height of the segment tree
  ll h = (ll)ceil(log2(n));
  h = (2 * (pow(2, h))) - 1;

  // Initialize the segment tree
  segment = new set<ll>[h];
}

// Function to get the result for the
// subarray from arr[l] to arr[r]
void getDistinct(ll l, ll r, ll n) {
  // Query for the range set
  set<ll> ans = query(1, 0, n - 1, l, r);

  cout << ans.size() << "\\n";
}

// Driver code
int main() {
  ll n, q, x, y;
  cin >> n >> q;
  ll arr[n];

  for (ll i = 0; i < n; i++)
    cin >> arr[i];

  init(n);

  // Bulid the segment tree
  build(1, 0, n - 1, arr);

  for (ll i = 0; i < q; i++) {
    cin >> x >> y;
    getDistinct(x - 1, y - 1, n);
  }
  return 0;
}