Problem p03033 (C++)

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

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
  ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
  ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

// Debug
#define debug(...)                                                             \
  {                                                                            \
    cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                         \
    for (auto &&X : {__VA_ARGS__})                                             \
      cerr << "[" << X << "] ";                                                \
    cerr << rt;                                                                \
  }

#define dump(a, h, w)                                                          \
  {                                                                            \
    cerr << __LINE__ << ": " << #a << " = [" << rt;                            \
    rep(_i, h) {                                                               \
      rep(_j, w) cerr << a[_i][_j] << sp;                                      \
      cerr << rt;                                                              \
    }                                                                          \
    cerr << "]" << rt;                                                         \
  }

#define vdump(a, n)                                                            \
  {                                                                            \
    cerr << __LINE__ << ": " << #a << " = [";                                  \
    rep(_i, n) if (_i) cerr << sp << a[_i];                                    \
    else cerr << a[_i];                                                        \
    cerr << "]" << rt;                                                         \
  }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
  io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
  return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
  ll k = n % m;
  return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
  n %= m;
  return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
  ll r = 1;
  rep(i, 64) {
    if (n & (1LL << i))
      r *= a;
    chmod(r, m);
    a *= a;
    chmod(a, m);
  }
  return r;
}
inline ll inv(const ll n, const ll m = MOD) {
  ll a = n, b = m, x = 1, y = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    x -= t * y;
    swap(x, y);
  }
  return modulo(x, m);
}

struct RUMQ {
  static const ll n = 1LL << 20;
  vector<ll> node, lazy, flag;
  RUMQ() : node(n * 2 - 1), lazy(n * 2 - 1), flag(n * 2 - 1) {}
  inline void eval(ll i, ll l, ll r) {
    if (flag[i]) {
      node[i] = lazy[i];
      if (r - l > 1) {
        lazy[i * 2 + 1] = lazy[i * 2 + 2] = lazy[i];
        flag[i * 2 + 1] = flag[i * 2 + 2] = true;
      }
      lazy[i] = 0;
      flag[i] = false;
    }
  }
  inline void update(ll a, ll b, ll x, ll i = 0, ll l = 0, ll r = 1LL << 20) {
    eval(i, l, r);
    if (b <= l || r <= a)
      return;
    if (a <= l && r <= b) {
      lazy[i] = x;
      flag[i] = true;
      eval(i, l, r);
    } else {
      update(a, b, x, i * 2 + 1, l, (l + r) / 2);
      update(a, b, x, i * 2 + 2, (l + r) / 2, r);
      node[i] = std::min(node[i * 2 + 1], node[i * 2 + 2]);
    }
  }
  inline ll min(ll a, ll b, ll i = 0, ll l = 0, ll r = 1LL << 20) {
    if (b <= l || r <= a)
      return INF;
    eval(i, l, r);
    if (a <= l && r <= b)
      return node[i];
    return std::min(min(a, b, i * 2 + 1, l, (l + r) / 2),
                    min(a, b, i * 2 + 2, (l + r) / 2, r));
  }
};

signed main() {
  ll N, Q;
  cin >> N >> Q;
  vector<pair<ll, pair<ll, ll>>> V;
  vector<ll> zaatsu;
  rep(i, N) {
    ll S, T, X;
    cin >> S >> T >> X;
    if (T - X < 0) {
      N--;
      continue;
    }
    V.push_back({X, {max(S - X, 0LL), T - X}});
    zaatsu.push_back(max(S - X, 0LL));
    zaatsu.push_back(T - X);
  }
  ll D[100000];
  rep(i, Q) {
    cin >> D[i];
    zaatsu.push_back(D[i]);
  }
  all(sort, zaatsu);
  rall(sort, V);
  RUMQ seg;
  seg.update(0, zaatsu.size(), INF);
  rep(i, N) {
    ll l = all(lower_bound, zaatsu, V[i].se.fi) - zaatsu.begin();
    ll r = all(lower_bound, zaatsu, V[i].se.se) - zaatsu.begin();
    seg.update(l, r, V[i].fi);
  }
  rep(i, Q) {
    ll d = all(lower_bound, zaatsu, D[i]) - zaatsu.begin();
    cout << (seg.min(d, d + 1) == INF ? -1 : seg.min(d, d + 1)) << rt;
  }
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined


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

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
  ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
  ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}

// Debug
#define debug(...)                                                             \
  {                                                                            \
    cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                         \
    for (auto &&X : {__VA_ARGS__})                                             \
      cerr << "[" << X << "] ";                                                \
    cerr << rt;                                                                \
  }

#define dump(a, h, w)                                                          \
  {                                                                            \
    cerr << __LINE__ << ": " << #a << " = [" << rt;                            \
    rep(_i, h) {                                                               \
      rep(_j, w) cerr << a[_i][_j] << sp;                                      \
      cerr << rt;                                                              \
    }                                                                          \
    cerr << "]" << rt;                                                         \
  }

#define vdump(a, n)                                                            \
  {                                                                            \
    cerr << __LINE__ << ": " << #a << " = [";                                  \
    rep(_i, n) if (_i) cerr << sp << a[_i];                                    \
    else cerr << a[_i];                                                        \
    cerr << "]" << rt;                                                         \
  }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
  io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
  return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
  ll k = n % m;
  return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
  n %= m;
  return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
  ll r = 1;
  rep(i, 64) {
    if (n & (1LL << i))
      r *= a;
    chmod(r, m);
    a *= a;
    chmod(a, m);
  }
  return r;
}
inline ll inv(const ll n, const ll m = MOD) {
  ll a = n, b = m, x = 1, y = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    x -= t * y;
    swap(x, y);
  }
  return modulo(x, m);
}

struct RUMQ {
  static const ll n = 1LL << 20;
  vector<ll> node, lazy, flag;
  RUMQ() : node(n * 2 - 1), lazy(n * 2 - 1), flag(n * 2 - 1) {}
  inline void eval(ll i, ll l, ll r) {
    if (flag[i]) {
      node[i] = lazy[i];
      if (r - l > 1) {
        lazy[i * 2 + 1] = lazy[i * 2 + 2] = lazy[i];
        flag[i * 2 + 1] = flag[i * 2 + 2] = true;
      }
      lazy[i] = 0;
      flag[i] = false;
    }
  }
  inline void update(ll a, ll b, ll x, ll i = 0, ll l = 0, ll r = 1LL << 20) {
    eval(i, l, r);
    if (b <= l || r <= a)
      return;
    if (a <= l && r <= b) {
      lazy[i] = x;
      flag[i] = true;
      eval(i, l, r);
    } else {
      update(a, b, x, i * 2 + 1, l, (l + r) / 2);
      update(a, b, x, i * 2 + 2, (l + r) / 2, r);
      node[i] = std::min(node[i * 2 + 1], node[i * 2 + 2]);
    }
  }
  inline ll min(ll a, ll b, ll i = 0, ll l = 0, ll r = 1LL << 20) {
    if (b <= l || r <= a)
      return INF;
    eval(i, l, r);
    if (a <= l && r <= b)
      return node[i];
    return std::min(min(a, b, i * 2 + 1, l, (l + r) / 2),
                    min(a, b, i * 2 + 2, (l + r) / 2, r));
  }
};

signed main() {
  ll N, Q;
  cin >> N >> Q;
  vector<pair<ll, pair<ll, ll>>> V;
  vector<ll> zaatsu;
  rep(i, N) {
    ll S, T, X;
    cin >> S >> T >> X;
    if (T - X < 0) {
      N--;
      continue;
    }
    V.push_back({X, {max(S - X, 0LL), T - X}});
    zaatsu.push_back(max(S - X, 0LL));
    zaatsu.push_back(T - X);
  }
  ll D[200000];
  rep(i, Q) {
    cin >> D[i];
    zaatsu.push_back(D[i]);
  }
  all(sort, zaatsu);
  rall(sort, V);
  RUMQ seg;
  seg.update(0, zaatsu.size(), INF);
  rep(i, N) {
    ll l = all(lower_bound, zaatsu, V[i].se.fi) - zaatsu.begin();
    ll r = all(lower_bound, zaatsu, V[i].se.se) - zaatsu.begin();
    seg.update(l, r, V[i].fi);
  }
  rep(i, Q) {
    ll d = all(lower_bound, zaatsu, D[i]) - zaatsu.begin();
    cout << (seg.min(d, d + 1) == INF ? -1 : seg.min(d, d + 1)) << rt;
  }
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined