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

// RAKSHIT KADAM

//  -- Declare array globally...
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree< int ,  null_type ,  less<int> ,  rb_tree_tag ,
// tree_order_statistics_node_update> find_by_order returns iterator to  element
// present at that index... order_of_key returns no. of elements having value
// stricktly less than that given in the order_of_key();
#warning !!!check the size of arrayss!!!

// NUMERIC DEFINITIONS :
#define INF 100000000000000005
#define inf 1000000003
#define MOD 1000000007
#define newMOD 998244353
#define MAX 200006
#define pi 3.1415926535897932384626433832795
#define ld long doubles
#define ll long long
#define int long long

#define P(gg)                                                                  \\
  for (auto rax : gg) {                                                        \\
    cout << rax << " ";                                                        \\
  }                                                                            \\
  cout << endl;
#define Need_for_speed(activated)                                              \\
  ios_base ::sync_with_stdio(0);                                               \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL)
#define satisfy                                                                \\
  ll t;                                                                        \\
  cin >> t;                                                                    \\
  while (t--)
#define inp(n)                                                                 \\
  int n;                                                                       \\
  cin >> n
#define mp make_pair
#define pb push_back
#define endl "\\n"
#define x first
#define y second
#define fore(i, a, b) for (ll i = a; i < b; i++)
#define forci(i, n) for (ll i = 0; i < n; i++)
#define vi vector<ll>
#define Endl endl
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll, ll>

#define input                                                                  \\
  freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define time                                                                   \\
  cerr << "\\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\\n";
using namespace std;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
int power(int x, unsigned int y, unsigned int m) {
  if (y == 0)
    return 1;
  int p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
ll modInverse(int a, int m) {
  { return power(a, m - 2, m); }
}
const int maxn = 500003;
ll tree[2 * maxn];
ll n;
void build() {
  for (ll i = n - 1; i > 0; i--) {
    tree[i] = tree[i << 1] + tree[i << 1 | 1];
  }
}
void update(ll val, ll pos) {

  for (tree[pos += n] = val; pos > 1; pos >>= 1) {
    tree[pos >> 1] = tree[pos] + tree[pos ^ 1];
    // MODIFY THE SIGN AS PER NEED;
  }
}
ll query(ll l, ll r) {
  // for querying [1,2]use 0,2
  ll res = 0;
  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
    if (l & 1)
      res += tree[l++];
    if (r & 1)
      res += tree[--r];
  }
  return res;
}
vector<pii> v[maxn];
map<ll, ll> m;
ll ans[maxn];
void solve() {
  cin >> n;
  ll q;
  cin >> q;
  ll a[n + 1];
  for (ll i = 1; i <= n; i++)
    cin >> a[i];
  ll aa, bb;
  for (ll i = 1; i <= q; i++) {
    cin >> aa >> bb;
    v[bb].pb(mp(aa, i));
  }
  for (ll i = 1; i <= n; i++) {
    update(1, i - 1);
    if (m.count(a[i])) {
      update(0, m[a[i]] - 1);
    }
    m[a[i]] = i;
    for (auto j : v[i]) {
      ans[j.y] = query(j.x - 1, i);
    }
  }
  for (ll i = 1; i <= q; i++) {
    cout << ans[i] << endl;
  }
}

signed main() {
  Need_for_speed(activated);

  // satisfy
  //     {
  //   solve();
  //    }
  //
  solve();
}


Error: 0

Fixed submission:

// RAKSHIT KADAM

//  -- Declare array globally...
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree< int ,  null_type ,  less<int> ,  rb_tree_tag ,
// tree_order_statistics_node_update> find_by_order returns iterator to  element
// present at that index... order_of_key returns no. of elements having value
// stricktly less than that given in the order_of_key();
#warning !!!check the size of arrayss!!!

// NUMERIC DEFINITIONS :
#define INF 100000000000000005
#define inf 1000000003
#define MOD 1000000007
#define newMOD 998244353
#define MAX 200006
#define pi 3.1415926535897932384626433832795
#define ld long doubles
#define ll long long
#define int long long

#define P(gg)                                                                  \\
  for (auto rax : gg) {                                                        \\
    cout << rax << " ";                                                        \\
  }                                                                            \\
  cout << endl;
#define Need_for_speed(activated)                                              \\
  ios_base ::sync_with_stdio(0);                                               \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL)
#define satisfy                                                                \\
  ll t;                                                                        \\
  cin >> t;                                                                    \\
  while (t--)
#define inp(n)                                                                 \\
  int n;                                                                       \\
  cin >> n
#define mp make_pair
#define pb push_back
#define endl "\\n"
#define x first
#define y second
#define fore(i, a, b) for (ll i = a; i < b; i++)
#define forci(i, n) for (ll i = 0; i < n; i++)
#define vi vector<ll>
#define Endl endl
#define lb lower_bound
#define ub upper_bound
#define pii pair<ll, ll>

#define input                                                                  \\
  freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define time                                                                   \\
  cerr << "\\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\\n";
using namespace std;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
int power(int x, unsigned int y, unsigned int m) {
  if (y == 0)
    return 1;
  int p = power(x, y / 2, m) % m;
  p = (p * p) % m;
  return (y % 2 == 0) ? p : (x * p) % m;
}
ll modInverse(int a, int m) {
  { return power(a, m - 2, m); }
}
const int maxn = 500003;
ll tree[2 * MAX];
ll n;
void build() {
  for (ll i = n - 1; i > 0; i--) {
    tree[i] = tree[i << 1] + tree[i << 1 | 1];
  }
}
void update(ll val, ll pos) {

  for (tree[pos += n] = val; pos > 1; pos >>= 1) {
    tree[pos >> 1] = tree[pos] + tree[pos ^ 1];
    // MODIFY THE SIGN AS PER NEED;
  }
}
ll query(ll l, ll r) {
  // for querying [1,2]use 0,2
  ll res = 0;
  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
    if (l & 1)
      res += tree[l++];
    if (r & 1)
      res += tree[--r];
  }
  return res;
}
vector<pii> v[maxn];
map<ll, ll> m;
ll ans[maxn];
void solve() {
  cin >> n;
  ll q;
  cin >> q;
  ll a[n + 1];
  for (ll i = 1; i <= n; i++)
    cin >> a[i];
  ll aa, bb;
  for (ll i = 1; i <= q; i++) {
    cin >> aa >> bb;
    v[bb].pb(mp(aa, i));
  }
  for (ll i = 1; i <= n; i++) {
    update(1, i - 1);
    if (m.count(a[i])) {
      update(0, m[a[i]] - 1);
    }
    m[a[i]] = i;
    for (auto j : v[i]) {
      ans[j.y] = query(j.x - 1, i);
    }
  }
  for (ll i = 1; i <= q; i++) {
    cout << ans[i] << endl;
  }
}

signed main() {
  Need_for_speed(activated);

  // satisfy
  //     {
  //   solve();
  //    }
  //
  solve();
}