Problem p03819 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;

template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}
template <typename T> inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T> inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}

#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a)                                                                \
  (remove_all_extents<decltype(a)>::type *)a,                                  \
      (remove_all_extents<decltype(a)>::type *)a +                             \
          sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)
#define DRANGE(c, p) begin(c), begin(c) + (p), end(c)

#define SZ(v) ((int)(v).size())
#define EXIST(c, e) ((c).find(e) != (c).end())

template <typename T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP(x) cerr << #x << " = " << (x) << endl

// セグメント木のユーティリティ
inline int chl(const int k) { return k * 2 + 1; }

inline int chr(const int k) { return k * 2 + 2; }

inline int mid(const int l, const int r) { return (l + r) / 2; }

#define LEFT(k, l, r) chl(k), l, mid(l, r)
#define RIGHT(k, l, r) chr(k), mid(l, r), r

namespace SegmentTree {
class RangeAdd_GetValue {
  const int N;
  vector<long long> dat_add;

public:
  RangeAdd_GetValue(const int n) : N(n), dat_add(N * 4) {}

  void add(const int a, const int b, const int x) {
    return add(a, b, x, 0, 0, N);
  }

  void add(const int a, const int b, const int x, int k, const int l,
           const int r) {
    if (b <= l || r <= a) {
      return;
    } else if (a <= l && r <= b) {
      dat_add[k] += x;
    } else {
      add(a, b, x, chl(k), l, mid(l, r));
      add(a, b, x, chr(k), mid(l, r), r);
    }
    return;
  }

  int value(const int p) { return value(p, 0, 0, N); }

  int value(const int p, const int k, const int l, const int r) {
    if (l == p && l + 1 == r) {
      return dat_add[k];
    } else if (l <= p && p < r) {
      return dat_add[k] + value(p, chl(k), l, mid(l, r)) +
             value(p, chr(k), mid(l, r), r);
    } else {
      return 0;
    }
  }
};
} // namespace SegmentTree
// rangeadd_getvalue( N )
// add( [ a, b ), x )
// value( pos )

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;

  int N, M;
  scanf("%d%d", &N, &M);

  static int L[1 << 18], R[1 << 18];
  REP(i, N) {
    scanf("%d%d", L + i, R + i);
    ++R[i];
  }

  VVI intervals(M + 1);
  REP(i, N) {
    const int l = R[i] - L[i];
    intervals[l].PB(i);
  }

  SegmentTree::RangeAdd_GetValue segtree(M + 4);

  int longer = N;
  REP(w, 1, M + 1) {
    int res = longer;
    for (int i = 0; i <= M; i += w) {
      res += segtree.value(i);
    }
    printf("%d\n", res);

    FOR(i, intervals[w]) {
      --longer;
      segtree.add(L[i], R[i], 1);
    }
  }

  fflush(stdout);

  return 0;
}


Fixed submission:
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;

template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}
template <typename T> inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T> inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}

#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a)                                                                \
  (remove_all_extents<decltype(a)>::type *)a,                                  \
      (remove_all_extents<decltype(a)>::type *)a +                             \
          sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)
#define DRANGE(c, p) begin(c), begin(c) + (p), end(c)

#define SZ(v) ((int)(v).size())
#define EXIST(c, e) ((c).find(e) != (c).end())

template <typename T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP(x) cerr << #x << " = " << (x) << endl

// セグメント木のユーティリティ
inline int chl(const int k) { return k * 2 + 1; }

inline int chr(const int k) { return k * 2 + 2; }

inline int mid(const int l, const int r) { return (l + r) / 2; }

#define LEFT(k, l, r) chl(k), l, mid(l, r)
#define RIGHT(k, l, r) chr(k), mid(l, r), r

namespace SegmentTree {
class RangeAdd_GetValue {
  const int N;
  vector<long long> dat_add;

public:
  RangeAdd_GetValue(const int n) : N(n), dat_add(N * 4) {}

  void add(const int a, const int b, const int x) {
    return add(a, b, x, 0, 0, N);
  }

  void add(const int a, const int b, const int x, int k, const int l,
           const int r) {
    if (b <= l || r <= a) {
      return;
    } else if (a <= l && r <= b) {
      dat_add[k] += x;
    } else {
      add(a, b, x, chl(k), l, mid(l, r));
      add(a, b, x, chr(k), mid(l, r), r);
    }
    return;
  }

  int value(const int p) { return value(p, 0, 0, N); }

  int value(const int p, const int k, const int l, const int r) {
    if (l == p && l + 1 == r) {
      return dat_add[k];
    } else if (l <= p && p < r) {
      return dat_add[k] + value(p, chl(k), l, mid(l, r)) +
             value(p, chr(k), mid(l, r), r);
    } else {
      return 0;
    }
  }
};
} // namespace SegmentTree
// rangeadd_getvalue( N )
// add( [ a, b ), x )
// value( pos )

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;

  int N, M;
  scanf("%d%d", &N, &M);

  static int L[1 << 19], R[1 << 19];
  REP(i, N) {
    scanf("%d%d", L + i, R + i);
    ++R[i];
  }

  VVI intervals(M + 1);
  REP(i, N) {
    const int l = R[i] - L[i];
    intervals[l].PB(i);
  }

  SegmentTree::RangeAdd_GetValue segtree(M + 4);

  int longer = N;
  REP(w, 1, M + 1) {
    int res = longer;
    for (int i = 0; i <= M; i += w) {
      res += segtree.value(i);
    }
    printf("%d\n", res);

    FOR(i, intervals[w]) {
      --longer;
      segtree.add(L[i], R[i], 1);
    }
  }

  fflush(stdout);

  return 0;
}