Language: C++

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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

typedef pair<double, double> pd;
typedef vector<pd> vpd;


#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> t chmax(t&a,u b){if(a<b)a=b; return a;};
template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

template<typename DATA>
class Sparse_Segment_Tree{
  public:
    ll n_;
    unordered_map<ull, DATA> lazy2;

    using F = function<DATA(DATA,DATA)>;
    const F f;
    const DATA init;

    Sparse_Segment_Tree(const F &f, const DATA init) : f(f), init(init){
      n_=1;
      return;
    };

    ~Sparse_Segment_Tree(void){
      return;
    };

    ll get_hash(ll l, ll r){
      return l*2000000001 + r;
    }

    //[a,b)の範囲に対してxを作用させる
    void rangeupdate2(ll a, ll b, DATA x, ll l, ll r){
      if(r<=a || b<=l) return;

      if(a<=l && r<=b){
        lazy2[get_hash(l,r)] = f(lazy2[get_hash(l,r)], x);
      }else{
        rangeupdate2(a, b, x, l, (l+r)/2);
        rangeupdate2(a, b, x, (l+r)/2, r);
      }
      return;
    }

    void rangeupdate2(ll a, ll b, DATA x){
      while(n_<=b){
        n_<<=1;
      }
      rangeupdate2(a, b, x, 0, n_);
      return;
    }

    DATA query(ll a, ll b, ll l, ll r){
      if(r<=a || b<=l) return init;

      DATA tmp = lazy2[get_hash(l,r)];
      if(r-l<=1) return tmp;

      DATA tmp_left = query(a, b, l, (l+r)/2);
      DATA tmp_right = query(a, b, (l+r)/2, r);
      return f(tmp, f(tmp_left, tmp_right));
    };

    DATA query(ll a, ll b){
      if(a<0 || a>=b){
        fprintf(stderr, "Segment_Tree Search Space Error\n");
        fprintf(stderr, "Desired:\n");
        fprintf(stderr, "%lld <= %lld < %lld\n", 0, a, b);
        exit(0);
      }
      if(n_<=b) n_<<=1;
      return query(a, b, 0, n_);
    };
};

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N, Q;
  IN(N,Q);

  auto f = [](ll a, ll b){return min(a,b);};
  Sparse_Segment_Tree<ll> que(f, 0);

  ll Shift = 1000000001;

  REP(i,N){
    ll S, T, X;
    IN(S,T,X);
    que.rangeupdate2(S-X+Shift, T-X+Shift, X-Shift);
  }

  REP(i,Q){
    ll D;
    IN(D);
    ll X = que.query(D+Shift, D+Shift+1)+Shift;
    if(X==Shift) X=-1;
    OUT(X);
  }

  return 0;
}


Compiler output:
a.cc:98:19: error: 'ull' was not declared in this scope; did you mean 'vll'?
   98 |     unordered_map<ull, DATA> lazy2;
      |                   ^~~
      |                   vll
a.cc:98:28: error: template argument 1 is invalid
   98 |     unordered_map<ull, DATA> lazy2;
      |                            ^
a.cc:98:28: error: template argument 3 is invalid
a.cc:98:28: error: template argument 4 is invalid
a.cc:98:28: error: template argument 5 is invalid
a.cc: In instantiation of 'void Sparse_Segment_Tree<DATA>::rangeupdate2(ll, ll, DATA, ll, ll) [with DATA = long long int; ll = long long int]':
a.cc:134:19:   required from 'void Sparse_Segment_Tree<DATA>::rangeupdate2(ll, ll, DATA) [with DATA = long long int; ll = long long int]'
  134 |       rangeupdate2(a, b, x, 0, n_);
      |       ~~~~~~~~~~~~^~~~~~~~~~~~~~~~
a.cc:176:21:   required from here
  176 |     que.rangeupdate2(S-X+Shift, T-X+Shift, X-Shift);
      |     ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
a.cc:122:14: error: subscripted value is neither array nor pointer
  122 |         lazy2[get_hash(l,r)] = f(lazy2[get_hash(l,r)], x);
      |         ~~~~~^
a.cc:122:39: error: subscripted value is neither array nor pointer
  122 |         lazy2[get_hash(l,r)] = f(lazy2[get_hash(l,r)], x);
      |                                  ~~~~~^
a.cc: In instantiation of 'DATA Sparse_Segment_Tree<DATA>::query(ll, ll, ll, ll) [with DATA = long long int; ll = long long int]':
a.cc:157:19:   required from 'DATA Sparse_Segment_Tree<DATA>::query(ll, ll) [with DATA = long long int; ll = long long int]'
  157 |       return query(a, b, 0, n_);
      |              ~~~~~^~~~~~~~~~~~~
a.cc:182:21:   required from here
  182 |     ll X = que.query(D+Shift, D+Shift+1)+Shift;
      |            ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
a.cc:141:23: error: subscripted value is neither array nor pointer
  141 |       DATA tmp = lazy2[get_hash(l,r)];
      |                  ~~~~~^