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);

class Sparse_Segment_Tree{
  public:
    ll n_;
    unordered_map<ll, int> lazy2;

    Sparse_Segment_Tree(void){
      n_=1;
      return;
    };

    ~Sparse_Segment_Tree(void){
      return;
    };

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

    //[a,b)の範囲に対してxを作用させる
    void rangeupdate2(ll a, ll b, int x, ll l, ll r){
      if(a<=l && r<=b){
        lazy2[get_hash(l,r)] = min(lazy2[get_hash(l,r)], x);
      }else{
        if(a<(l+r)/2) rangeupdate2(a, b, x, l, (l+r)/2);
        if((l+r)/2<b) rangeupdate2(a, b, x, (l+r)/2, r);
      }
      return;
    }

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

    int pointquery(ll a, ll l, ll r){
      int tmp = 0;
      if(lazy2.find(get_hash(l,r))!=lazy2.end()) tmp = lazy2[get_hash(l,r)];
      if(r-l<=1) return tmp;
      if(a<(l+r)/2) return min(tmp, pointquery(a, l, (l+r)/2));
      return min(tmp, pointquery(a, (l+r)/2, r));
    };

    int pointquery(ll a){
      if(a<0){
        fprintf(stderr, "Segment_Tree Search Space Error\n");
        fprintf(stderr, "Desired:\n");
        fprintf(stderr, "%lld <= %lld\n", 0, a);
        exit(0);
      }else if(n_<=a){
        return 0;
      }
      return pointquery(a, 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);

  Sparse_Segment_Tree que;

  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.pointquery(D+Shift)+Shift;
    if(X==Shift) X=-1;
    OUT(X);
  }

  return 0;
}

da-no-MacBook-Air:128 fockl$ 
da-no-MacBook-Air:128 fockl$ vi E2.cpp
da-no-MacBook-Air:128 fockl$ g++ E2.cpp
./a	E2.cpp: In function 'int main()':
E2.cpp:89:9: error: 'IN' was not declared in this scope
   IN(N,Q);
da-no-MacBook-Air:128 fockl$ vi E2.cpp
da-no-MacBook-Air:128 fockl$ g++ E2.cpp
./	da-no-MacBook-Air:128 fockl$ ./a.out < E_input1.txt 
2210-113-1da-no-MacBook-Air:128 fockl$ vi E2.cpp
da-no-MacBook-Air:128 fockl$ g++ E2.cpp
da-no-MacBook-Air:128 fockl$ ./a.out < E_input1.txt 
2
2
10
-1
13
-1
da-no-MacBook-Air:128 fockl$ cat E2.cpp
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<ll> vll;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#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;
}

template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};

class Sparse_Segment_Tree{
  public:
    ll n_;
    unordered_map<ll, int> lazy2;

    Sparse_Segment_Tree(void){
      n_=1;
      return;
    };

    ~Sparse_Segment_Tree(void){
      return;
    };

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

    //[a,b)の範囲に対してxを作用させる
    void rangeupdate2(ll a, ll b, int x, ll l, ll r){
      if(a<=l && r<=b){
        chmin(lazy2[get_hash(l,r)], x);
      }else{
        if(a<(l+r)/2) rangeupdate2(a, b, x, l, (l+r)/2);
        if((l+r)/2<b) rangeupdate2(a, b, x, (l+r)/2, r);
      }
      return;
    }

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

    int pointquery(ll a, ll l, ll r){
      int tmp = 0;
      if(lazy2.find(get_hash(l,r))!=lazy2.end()) tmp = lazy2[get_hash(l,r)];
      if(r-l<=1) return tmp;
      if(a<(l+r)/2) return min(tmp, pointquery(a, l, (l+r)/2));
      return min(tmp, pointquery(a, (l+r)/2, r));
    };

    int pointquery(ll a){
      if(a<0){
        fprintf(stderr, "Segment_Tree Search Space Error\n");
        fprintf(stderr, "Desired:\n");
        fprintf(stderr, "%lld <= %lld\n", 0, a);
        exit(0);
      }else if(n_<=a){
        return 0;
      }
      return pointquery(a, 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;
  cin >> N >> Q;

  Sparse_Segment_Tree que;

  ll Shift = 1000000001;

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

  ll D;
  REP(i,Q){
    cin >> D;
    ll X = que.pointquery(D+Shift)+Shift;
    if(X==Shift) X=-1;
    cout << X << "\n";
  }

  return 0;
}


Compiler output:
a.cc:181:29: warning: multi-character literal with 10 characters exceeds 'int' size of 4 bytes
  181 | ./a     E2.cpp: In function 'int main()':
      |                             ^~~~~~~~~~~~
a.cc:182:21: warning: multi-character character constant [-Wmultichar]
  182 | E2.cpp:89:9: error: 'IN' was not declared in this scope
      |                     ^~~~
a.cc:178:1: error: 'da' does not name a type
  178 | da-no-MacBook-Air:128 fockl$
      | ^~
a.cc:184:1: error: 'da' does not name a type
  184 | da-no-MacBook-Air:128 fockl$ vi E2.cpp
      | ^~
a.cc:210:6: error: redefinition of 'template<class First> void debug_print_in(First)'
  210 | void debug_print_in(First first){
      |      ^~~~~~~~~~~~~~
a.cc:30:6: note: 'template<class First> void debug_print_in(First)' previously declared here
   30 | void debug_print_in(First first){
      |      ^~~~~~~~~~~~~~
a.cc:216:6: error: redefinition of 'template<class First, class ... Rest> void debug_print_in(First, Rest ...)'
  216 | void debug_print_in(First first, Rest... rest){
      |      ^~~~~~~~~~~~~~
a.cc:36:6: note: 'template<class First, class ... Rest> void debug_print_in(First, Rest ...)' previously declared here
   36 | void debug_print_in(First first, Rest... rest){
      |      ^~~~~~~~~~~~~~
a.cc:222:30: error: redefinition of 'template<class t, class u> t chmin(t&, u)'
  222 | template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};
      |                              ^~~~~
a.cc:67:30: note: 'template<class t, class u> t chmin(t&, u)' previously declared here
   67 | template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};
      |                              ^~~~~
a.cc:224:7: error: redefinition of 'class Sparse_Segment_Tree'
  224 | class Sparse_Segment_Tree{
      |       ^~~~~~~~~~~~~~~~~~~
a.cc:94:7: note: previous definition of 'class Sparse_Segment_Tree'
   94 | class Sparse_Segment_Tree{
      |       ^~~~~~~~~~~~~~~~~~~
a.cc:280:5: error: redefinition of 'int main()'
  280 | int main(){
      |     ^~~~
a.cc:150:5: note: 'int main()' previously defined here
  150 | int main(){
      |     ^~~~