Problem p01973 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
//    #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
//    #define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>

#define ssa pair<string, int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
class pa3 {
public:
  int x, y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  double x;
  int y, z, w;
  pa4(double x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

#define ppa pair<int, pas>
class Point {
public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
  }
};
typedef Point Vector;
#define pl pair<int, pas>
struct Segment {
  Point p1, p2;
};
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }

bool parareru(Point a, Point b, Point c, Point d) {
  //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
  return abs(cross(a - b, d - c)) < EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < EPS)
    return (c - a).absv();
  if (dot(a - b, c - b) < EPS)
    return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    //		cout<<"sss"<<endl;
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)
      return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)
      return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)
      return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)
      return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            EPS) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            EPS);
}

double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b))
    return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);

  return a.p1 + (a.p2 - a.p1) * t;
}

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int gcd(int v, int b) {
  if (v > b)
    return gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return gcd(v, b % v);
}

double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}

//         int pr[2000010];
//       int inv[2000010];

int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  if (rr % 2 == 1)
    return (beki(wa, rr - 1, warukazu) * wa) % warukazu;
  int zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
double bekid(double w, int r) {
  if (r == 0)
    return 1.0;
  if (r == 1)
    return w;
  if (r % 2)
    return bekid(w, r - 1) * w;
  double f = bekid(w, r / 2);
  return f * f;
}
/*
            int comb(int nn,int rr){
                    int r=pr[nn]*inv[rr];
                    r%=inf;
                    r*=inv[nn-rr];
                    r%=inf;
                    return r;
            }

void gya(int ert){
    pr[0]=1;
    for(int i=1;i<ert;i++){
            pr[i]=(pr[i-1]*i)%inf;
    }
    for(int i=0;i<ert;i++) inv[i]=beki(pr[i],inf-2,inf);

}
 */
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
// vector<double> ans(100000000),ans2(100000000)
const int MAXN = 100020;
namespace SA {
int rank[MAXN], tmp[MAXN];
int n, k;
bool compare_sa(int i, int j) {
  if (rank[i] != rank[j])
    return rank[i] < rank[j];
  int ri = (i + k <= n) ? rank[i + k] : -1;
  int rj = (j + k <= n) ? rank[j + k] : -1;
  return ri < rj;
}

void createSA(const string &s, int *sa) {
  n = s.size();
  for (int i = 0; i <= n; i++) {
    sa[i] = i;
    rank[i] = i < n ? s[i] : -1;
  }
  for (k = 1; k <= n; k *= 2) {
    sort(sa, sa + n + 1, compare_sa);
    tmp[sa[0]] = 0;
    for (int i = 1; i <= n; i++) {
      tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
    }
    for (int i = 0; i <= n; i++)
      rank[i] = tmp[i];
  }
}
} // namespace SA

struct segsum {
  //       1
  //   2        3
  // 4   5   6    7

private:
public:
  // (1<<15)=32768
  // 1<<16 = 65536
  // 1<<17 = 131072
  // 1<<18 = 262144

  int cor = (1 << 17);

  vector<int> vec;
  vector<int> lazy;

  void shoki1() { vec.resize(2 * cor + 3, 0); }
  void shoki2() {
    for (int i = cor - 1; i > 0; i--)
      vec[i] = vec[2 * i] + vec[2 * i + 1];
  }

  void updadd(int x, int w) {
    // x ���ڂ� w���Z
    x += cor;
    vec[x] += w;
    while (1) {
      x /= 2;
      if (x == 0)
        break;
      vec[x] = vec[2 * x] + vec[2 * x + 1];
    }
  }

  void updchan(int x, int w) {
    // x���ڂ�w�ɕύX
    x += cor;
    vec[x] = w;
    while (1) {
      x /= 2;
      if (x == 0)
        break;
      vec[x] = vec[2 * x] + vec[2 * x + 1];
    }
  }
  // [a,b)
  // k-th node
  // k no kukanha [l,r)
  int sum(int a, int b, int k = 1, int l = 0, int r = -10) {
    if (r < 0)
      r = cor;

    //	cout<<a<<" "<<b<<" "<<k<<" "<<l<<" "<<r<<endl;

    if (a <= l && r <= b) {
      return vec[k];
    }
    if (r <= a || b <= l) {
      return 0;
    }

    int v1 = sum(a, b, k * 2, l, (l + r) / 2),
        v2 = sum(a, b, k * 2 + 1, (l + r) / 2, r);
    return v1 + v2;
  }
};
segsum SE;
int sa[100020];
vector<pa2> ve;
signed main() {
  string s;
  cin >> s;

  SA::createSA(s, sa);
  int l = s.length();
  // for(int i=0;i<=l;i++)cout<<sa[i]<<" "<<s.substr(sa[i])<<endl;;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string t;
    cin >> t;

    int tl = t.length();
    sa[l + 1] = 100001;
    int si = 0, ue = l + 1, me;
    while (ue - si > 1) {
      me = (ue + si) / 2;
      if (s.substr(sa[me]) < t)
        si = me;
      else
        ue = me;
    }
    char c = 'z' + 1;
    while (s.length() <= 100000)
      s += 'A';
    while (s.length() < 100030)
      s += c;
    int kagen = ue;
    //	cout<<kagen<<endl;
    si = 0, ue = l + 1;
    t.back()++;

    while (ue - si > 1) {
      me = (ue + si) / 2;
      if (s.substr(sa[me], tl) < t)
        si = me;
      else
        ue = me;
    }
    int jougen = ue;
    //	cout<<jougen<<endl;
    for (int i = kagen; i < jougen; i++) {
      //	cout<<sa[i]<<" "<<s.substr(sa[i])<<endl;
      ve.pb((pa2){sa[i], sa[i] + tl});
      if (ve.size() > 10000000)
        exit(1);
    }
    //	cout<<endl;
  }
  sort(ve.begin(), ve.end());
  SE.shoki1();
  SE.shoki2();
  int ans = 0;
  for (int i = 0; i < ve.size(); i++) {
    //		cout<<ve[i].x<<" "<<ve[i].y<<endl;
    if (SE.sum(ve[i].x, ve[i].y) > 0)
      continue;

    ans++;
    SE.updadd(ve[i].y - 1, 1);
  }
  cout << ans << endl;

  return 0;
}


Fixed submission:
#include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
//    #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
//    #define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>

#define ssa pair<string, int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
using namespace std;
class pa3 {
public:
  int x, y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  double x;
  int y, z, w;
  pa4(double x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

#define ppa pair<int, pas>
class Point {
public:
  double x, y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator+(Point p) { return Point(x + p.x, y + p.y); }
  Point operator-(Point p) { return Point(x - p.x, y - p.y); }
  Point operator*(double a) { return Point(x * a, y * a); }
  Point operator/(double a) { return Point(x / a, y / a); }
  double absv() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const Point &p) const {
    return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
  }
};
typedef Point Vector;
#define pl pair<int, pas>
struct Segment {
  Point p1, p2;
};
double dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }
double cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }

bool parareru(Point a, Point b, Point c, Point d) {
  //	if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
  return abs(cross(a - b, d - c)) < EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
  if (dot(b - a, c - a) < EPS)
    return (c - a).absv();
  if (dot(a - b, c - b) < EPS)
    return (c - b).absv();
  return abs(cross(b - a, c - a)) / (b - a).absv();
}
bool is_intersected_ls(Segment a, Segment b) {
  if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)
    return false;
  if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&
      parareru((a.p2), (a.p1), (a.p1), (b.p1))) {
    //		cout<<"sss"<<endl;
    if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)
      return true;
    if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)
      return true;
    if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)
      return true;
    if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)
      return true;
    return false;
  } else
    return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <
            EPS) &&
           (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <
            EPS);
}

double segment_dis(Segment a, Segment b) {
  if (is_intersected_ls(a, b))
    return 0;
  double r = distance_ls_p(a.p1, a.p2, b.p1);
  r = min(r, distance_ls_p(a.p1, a.p2, b.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p2));
  r = min(r, distance_ls_p(b.p1, b.p2, a.p1));
  return r;
}
Point intersection_ls(Segment a, Segment b) {
  Point ba = b.p2 - b.p1;
  double d1 = abs(cross(ba, a.p1 - b.p1));
  double d2 = abs(cross(ba, a.p2 - b.p1));
  double t = d1 / (d1 + d2);

  return a.p1 + (a.p2 - a.p1) * t;
}

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int gcd(int v, int b) {
  if (v > b)
    return gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return gcd(v, b % v);
}

double distans(double x1, double y1, double x2, double y2) {
  double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return sqrt(rr);
}

//         int pr[2000010];
//       int inv[2000010];

int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  if (rr % 2 == 1)
    return (beki(wa, rr - 1, warukazu) * wa) % warukazu;
  int zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
double bekid(double w, int r) {
  if (r == 0)
    return 1.0;
  if (r == 1)
    return w;
  if (r % 2)
    return bekid(w, r - 1) * w;
  double f = bekid(w, r / 2);
  return f * f;
}
/*
            int comb(int nn,int rr){
                    int r=pr[nn]*inv[rr];
                    r%=inf;
                    r*=inv[nn-rr];
                    r%=inf;
                    return r;
            }

void gya(int ert){
    pr[0]=1;
    for(int i=1;i<ert;i++){
            pr[i]=(pr[i-1]*i)%inf;
    }
    for(int i=0;i<ert;i++) inv[i]=beki(pr[i],inf-2,inf);

}
 */
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
// vector<double> ans(100000000),ans2(100000000)
const int MAXN = 100020;
namespace SA {
int rank[MAXN], tmp[MAXN];
int n, k;
bool compare_sa(int i, int j) {
  if (rank[i] != rank[j])
    return rank[i] < rank[j];
  int ri = (i + k <= n) ? rank[i + k] : -1;
  int rj = (j + k <= n) ? rank[j + k] : -1;
  return ri < rj;
}

void createSA(const string &s, int *sa) {
  n = s.size();
  for (int i = 0; i <= n; i++) {
    sa[i] = i;
    rank[i] = i < n ? s[i] : -1;
  }
  for (k = 1; k <= n; k *= 2) {
    sort(sa, sa + n + 1, compare_sa);
    tmp[sa[0]] = 0;
    for (int i = 1; i <= n; i++) {
      tmp[sa[i]] = tmp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
    }
    for (int i = 0; i <= n; i++)
      rank[i] = tmp[i];
  }
}
} // namespace SA

struct segsum {
  //       1
  //   2        3
  // 4   5   6    7

private:
public:
  // (1<<15)=32768
  // 1<<16 = 65536
  // 1<<17 = 131072
  // 1<<18 = 262144

  int cor = (1 << 17);

  vector<int> vec;
  vector<int> lazy;

  void shoki1() { vec.resize(2 * cor + 3, 0); }
  void shoki2() {
    for (int i = cor - 1; i > 0; i--)
      vec[i] = vec[2 * i] + vec[2 * i + 1];
  }

  void updadd(int x, int w) {
    // x ���ڂ� w���Z
    x += cor;
    vec[x] += w;
    while (1) {
      x /= 2;
      if (x == 0)
        break;
      vec[x] = vec[2 * x] + vec[2 * x + 1];
    }
  }

  void updchan(int x, int w) {
    // x���ڂ�w�ɕύX
    x += cor;
    vec[x] = w;
    while (1) {
      x /= 2;
      if (x == 0)
        break;
      vec[x] = vec[2 * x] + vec[2 * x + 1];
    }
  }
  // [a,b)
  // k-th node
  // k no kukanha [l,r)
  int sum(int a, int b, int k = 1, int l = 0, int r = -10) {
    if (r < 0)
      r = cor;

    //	cout<<a<<" "<<b<<" "<<k<<" "<<l<<" "<<r<<endl;

    if (a <= l && r <= b) {
      return vec[k];
    }
    if (r <= a || b <= l) {
      return 0;
    }

    int v1 = sum(a, b, k * 2, l, (l + r) / 2),
        v2 = sum(a, b, k * 2 + 1, (l + r) / 2, r);
    return v1 + v2;
  }
};
segsum SE;
int sa[100020];
vector<pa2> ve;
signed main() {
  string s;
  cin >> s;

  SA::createSA(s, sa);
  int l = s.length();
  // for(int i=0;i<=l;i++)cout<<sa[i]<<" "<<s.substr(sa[i])<<endl;;
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    string t;
    cin >> t;

    int tl = t.length();
    sa[l + 1] = 100001;
    int si = 0, ue = l + 1, me;
    while (ue - si > 1) {
      me = (ue + si) / 2;
      if (s.substr(sa[me]) < t)
        si = me;
      else
        ue = me;
    }
    char c = 'z' + 1;
    while (s.length() <= 100000)
      s += 'A';
    while (s.length() < 100030)
      s += c;
    int kagen = ue;
    //	cout<<kagen<<endl;
    si = 0, ue = l + 1;
    t.back()++;

    while (ue - si > 1) {
      me = (ue + si) / 2;
      if (s.substr(sa[me], tl) < t)
        si = me;
      else
        ue = me;
    }
    int jougen = ue;
    //	cout<<jougen<<endl;
    for (int i = kagen; i < jougen; i++) {
      //	cout<<sa[i]<<" "<<s.substr(sa[i])<<endl;
      ve.pb((pa2){sa[i], sa[i] + tl});
      if (ve.size() > 10000000) {
        cout << l << endl;
        return 0;
      }
    }
    //	cout<<endl;
  }
  sort(ve.begin(), ve.end());
  SE.shoki1();
  SE.shoki2();
  int ans = 0;
  for (int i = 0; i < ve.size(); i++) {
    //		cout<<ve[i].x<<" "<<ve[i].y<<endl;
    if (SE.sum(ve[i].x, ve[i].y) > 0)
      continue;

    ans++;
    SE.updadd(ve[i].y - 1, 1);
  }
  cout << ans << endl;

  return 0;
}