Problem p03819 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;

typedef long long signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i = (r); i >= (l); i--)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define FOR(i, v) for (auto i = v.begin(); i != v.end(); ++i)
#define RFOR(i, v) for (auto i = v.rbegin(); i != v.rend(); ++i)

template <typename T> bool setmin(T &a, T b) {
  if (a <= b) {
    return false;
  } else {
    a = b;
    return true;
  }
}
template <typename T> bool setmax(T &a, T b) {
  if (b <= a) {
    return false;
  } else {
    a = b;
    return true;
  }
}
template <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[";
  FOR(it, v) {
    if (it != v.begin()) {
      os << ", ";
    }
    os << *it;
  }
  os << "]";
  return os;
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
  os << "<" << p.FI << ", " << p.SE << ">";
  return os;
}

// ---- ----

int n, m, l[300000], r[300000];
vector<int> dd[100002];
set<int> s;
int ans[100002];

int main() {
  cin >> n >> m;
  inc(i, n) { cin >> l[i] >> r[i]; }

  inc1(d, m) {
    int i = d;
    while (i <= m) {
      dd[i].PB(d);
      i += d;
    }
  }

  inc(i, n) {
    if ((l[i] - 1) * 2 <= r[i]) {
      ans[1]++;
      ans[r[i] + 1]--;
    } else {
      if (r[i] - l[i] < 100) {
        s.clear();
        incII(j, l[i], r[i]) {
          inc(k, dd[j].size()) { s.insert(dd[j][k]); }
        }
        FOR(it, s) {
          ans[*it]++;
          ans[(*it) + 1]--;
        }
        continue;
      }
      int llim = (r[i] + 1) - l[i] + 1;
      int rlim = m + 2;
      ans[1]++;
      ans[llim]--;
      inc1(d, m) {
        bool flag = false;
        int nl = (l[i] + (d - 1)) / d;
        int nr = (r[i] + 1 + (d - 1)) / d;
        if (nl <= llim) {
          flag = true;
        }
        setmax(nl, llim);
        setmin(nr, rlim);
        ans[nl]++;
        ans[nr]--;
        rlim = nl;
        if (flag) {
          break;
        }
      }
    }
  }

  inc1(i, m) {
    ans[i] += ans[i - 1];
    cout << ans[i] << "\n";
  }

  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;

typedef long long signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for (int i = (l); i < (r); i++)
#define incII(i, l, r) for (int i = (l); i <= (r); i++)
#define decID(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define decII(i, l, r) for (int i = (r); i >= (l); i--)
#define inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) < (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define FOR(i, v) for (auto i = v.begin(); i != v.end(); ++i)
#define RFOR(i, v) for (auto i = v.rbegin(); i != v.rend(); ++i)

template <typename T> bool setmin(T &a, T b) {
  if (a <= b) {
    return false;
  } else {
    a = b;
    return true;
  }
}
template <typename T> bool setmax(T &a, T b) {
  if (b <= a) {
    return false;
  } else {
    a = b;
    return true;
  }
}
template <typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[";
  FOR(it, v) {
    if (it != v.begin()) {
      os << ", ";
    }
    os << *it;
  }
  os << "]";
  return os;
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
  os << "<" << p.FI << ", " << p.SE << ">";
  return os;
}

// ---- ----

int n, m, l[300000], r[300000];
vector<int> dd[100002];
set<int> s;
int ans[100002];

int main() {
  cin >> n >> m;
  inc(i, n) { cin >> l[i] >> r[i]; }

  inc1(d, m) {
    int i = d;
    while (i <= m) {
      dd[i].PB(d);
      i += d;
    }
  }

  inc(i, n) {
    if ((l[i] - 1) * 2 <= r[i]) {
      ans[1]++;
      ans[r[i] + 1]--;
    } else {
      if (r[i] - l[i] < 30) {
        s.clear();
        incII(j, l[i], r[i]) {
          inc(k, dd[j].size()) { s.insert(dd[j][k]); }
        }
        FOR(it, s) {
          ans[*it]++;
          ans[(*it) + 1]--;
        }
        continue;
      }
      int llim = (r[i] + 1) - l[i] + 1;
      int rlim = m + 2;
      ans[1]++;
      ans[llim]--;
      inc1(d, m) {
        bool flag = false;
        int nl = (l[i] + (d - 1)) / d;
        int nr = (r[i] + 1 + (d - 1)) / d;
        if (nl <= llim) {
          flag = true;
        }
        setmax(nl, llim);
        setmin(nr, rlim);
        ans[nl]++;
        ans[nr]--;
        rlim = nl;
        if (flag) {
          break;
        }
      }
    }
  }

  inc1(i, m) {
    ans[i] += ans[i - 1];
    cout << ans[i] << "\n";
  }

  return 0;
}