Problem p03033 (C++)

Buggy submission (status: Time Limit Exceeded):
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()                                                              \
  {                                                                            \
    cin.tie(0);                                                                \
    cout.sync_with_stdio(false);                                               \
  }
#define reach(i, a) for (auto i : a)
#define rep(i, n) for (int i = 0; i < ((int)n); i++)
#define REP(i, n) for (int i = 0; i <= ((int)n); i++)
#define srep(i, a, n) for (int i = a; i < ((int)n); i++)
#define SREP(i, a, n) for (int i = a; i <= ((int)n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define all(a) (a).begin(), (a).end()
#define mp(a, b) make_pair(a, b)
#define mt make_tuple
#define pb push_back
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
  os << "[";
  rep(i, vec.size()) os << (i ? ", " : "") << vec[i];
  os << "]";
  return os;
}
template <typename T> istream &operator>>(istream &is, pair<T, T> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, pair<T, T> &p) {
  os << p.first << " " << p.second;
  return os;
}
int bitcnt(ll x) {
  x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
  x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
  x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
  x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
  x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
  x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
  return x;
}
int bitcnt(int x) {
  x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
  x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
  x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
  x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
  x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
  return x;
}
ll sqrtll(ll x) {
  ll left = 0, right = x;
  rep(i, 100) {
    ll mid = (left + right) >> 1;
    if (mid * mid <= x)
      left = mid;
    else
      right = mid;
  }
  return left;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
#define debug(x) printf("Case #%d: ", x)
#define DEBUG 0
const ld infl = 1e100;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const ll inf = 1e18;
const int dx[] = {1, 0, -1, 0, 0};
const int dy[] = {0, 1, 0, -1, 0};

int ret[200010];

int main() {
  int n, q;
  cin >> n >> q;
  rep(i, q) ret[i] = mod;
  vector<pair<int, pii>> dat(n);
  rep(i, n) {
    int s, t, x;
    cin >> s >> t >> x;
    dat[i] = mp(x, mp(s, t));
  }
  sort(all(dat));
  set<pii> d;
  rep(i, q) {
    int D;
    cin >> D;
    d.insert(mp(D, i));
  }
  d.insert(mp((int)mod, -1));
  rep(i, n) {
    // [s, t)でxを封鎖=>[s-x,t-x)をカットします
    // カットされたらdから消しておこう
    int s = dat[i].second.first, t = dat[i].second.second;
    int x = dat[i].first;
    auto left = lower_bound(all(d), mp(s - x, -1));
    while (left->first < t - x) {
      ret[left->second] = x;
      left = d.erase(left);
    }
  }
  rep(i, q) if (ret[i] == mod) ret[i] = -1;
  rep(i, q) cout << ret[i] << endl;
  return 0;
}

Fixed submission:
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()                                                              \
  {                                                                            \
    cin.tie(0);                                                                \
    cout.sync_with_stdio(false);                                               \
  }
#define reach(i, a) for (auto i : a)
#define rep(i, n) for (int i = 0; i < ((int)n); i++)
#define REP(i, n) for (int i = 0; i <= ((int)n); i++)
#define srep(i, a, n) for (int i = a; i < ((int)n); i++)
#define SREP(i, a, n) for (int i = a; i <= ((int)n); i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define RREP(i, n) for (int i = n; i >= 0; i--)
#define all(a) (a).begin(), (a).end()
#define mp(a, b) make_pair(a, b)
#define mt make_tuple
#define pb push_back
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
  os << "[";
  rep(i, vec.size()) os << (i ? ", " : "") << vec[i];
  os << "]";
  return os;
}
template <typename T> istream &operator>>(istream &is, pair<T, T> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, pair<T, T> &p) {
  os << p.first << " " << p.second;
  return os;
}
int bitcnt(ll x) {
  x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
  x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
  x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
  x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
  x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
  x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
  return x;
}
int bitcnt(int x) {
  x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
  x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
  x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
  x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
  x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
  return x;
}
ll sqrtll(ll x) {
  ll left = 0, right = x;
  rep(i, 100) {
    ll mid = (left + right) >> 1;
    if (mid * mid <= x)
      left = mid;
    else
      right = mid;
  }
  return left;
}
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }
#define debug(x) printf("Case #%d: ", x)
#define DEBUG 0
const ld infl = 1e100;
const ll mod = 1e9 + 7;
const ld eps = 1e-9;
const ll inf = 1e18;
const int dx[] = {1, 0, -1, 0, 0};
const int dy[] = {0, 1, 0, -1, 0};

int ret[200010];

int main() {
  int n, q;
  cin >> n >> q;
  rep(i, q) ret[i] = mod;
  vector<pair<int, pii>> dat(n);
  rep(i, n) {
    int s, t, x;
    cin >> s >> t >> x;
    dat[i] = mp(x, mp(s, t));
  }
  sort(all(dat));
  set<pii> d;
  rep(i, q) {
    int D;
    cin >> D;
    d.insert(mp(D, i));
  }
  d.insert(mp((int)mod, -1));
  rep(i, n) {
    // [s, t)でxを封鎖=>[s-x,t-x)をカットします
    // カットされたらdから消しておこう
    int s = dat[i].second.first, t = dat[i].second.second;
    int x = dat[i].first;
    auto left = d.lower_bound(mp(s - x, -1));
    while (left->first < t - x) {
      ret[left->second] = x;
      left = d.erase(left);
    }
  }
  rep(i, q) if (ret[i] == mod) ret[i] = -1;
  rep(i, q) cout << ret[i] << endl;
  return 0;
}