Problem p03033 (C++)

Buggy submission (status: Time Limit Exceeded):
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <immintrin.h>
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
#endif

using namespace std;

// 呪文
#define DUMPOUT cerr
#define dump(...)                                                              \
  DUMPOUT << "  ";                                                             \
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \
          << endl;                                                             \
  DUMPOUT << "    ";                                                           \
  dump_func(__VA_ARGS__)

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t i = 0; i < v.size(); i++)
    is >> v[i];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}

template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
  Ty result = 1;
  while (e > 0) {
    if (e & 1)
      result = (result * n) % m;
    e >>= 1;
    n = (n * n) % m;
  }
  return result;
}

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

#define int long long

const int INF = INT64_MAX;
struct LazySegmentTree {
private:
  int n;
  vector<int> node, lazy;
  vector<bool> lazyFlag;

public:
  LazySegmentTree(vector<int> v) {
    int sz = (int)v.size();
    n = 1;
    while (n < sz)
      n *= 2;
    node.resize(2 * n - 1);
    lazy.resize(2 * n - 1, INF);
    lazyFlag.resize(2 * n - 1, false);

    for (int i = 0; i < sz; i++)
      node[i + n - 1] = v[i];
    for (int i = n - 2; i >= 0; i--)
      node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
  }

  void lazyEvaluate(int k, int l, int r) {
    if (lazyFlag[k]) {
      node[k] = lazy[k];
      if (r - l > 1) {
        lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
        lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
      }
      lazyFlag[k] = false;
    }
  }

  void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
    if (r < 0)
      r = n;
    lazyEvaluate(k, l, r);
    if (b <= l || r <= a)
      return;
    if (a <= l && r <= b) {
      lazy[k] = x;
      lazyFlag[k] = true;
      lazyEvaluate(k, l, r);
    } else {
      update(a, b, x, 2 * k + 1, l, (l + r) / 2);
      update(a, b, x, 2 * k + 2, (l + r) / 2, r);
      node[k] = min(node[2 * k + 1], node[2 * k + 2]);
    }
  }

  int find(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0)
      r = n;
    lazyEvaluate(k, l, r);
    if (b <= l || r <= a)
      return INF;
    if (a <= l && r <= b)
      return node[k];
    int vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
    int vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
    return min(vl, vr);
  }
};

int N, Q;
vector<int> S, T, X;
vector<int> D;
struct Con {
  int s, t, x;
  Con(int s, int t, int x) : s(s), t(t), x(x) {}
};
ostream &operator<<(ostream &os, const Con &c) {
  os << "{s:" << c.s << ",t:" << c.t << ",x:" << c.x << "}";
  return os;
}
vector<Con> cons;

map<int, vector<pii>> chart;

signed main() {

  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  cin >> N >> Q;
  S.resize(N);
  T.resize(N);
  X.resize(N);
  REP(i, N) {
    cin >> S[i] >> T[i] >> X[i];
    cons.emplace_back(S[i], T[i], X[i]);
  }
  D.resize(Q);
  cin >> D;

  sort(all(cons), [&](const Con &a, const Con &b) {
    if (a.x == b.x)
      return a.s < b.s;
    return a.x < b.x;
  });

  for (auto &c : cons) {
    int x = c.x;
    int s = c.s;
    int t = c.t;
    auto &ch = chart[x];
    if (!ch.empty() && ch.back().second == s)
      ch.back().second = t;
    else
      ch.emplace_back(s, t);
  }

  set<int> timeSet;

  // conv to chart
  for (auto &entry : chart) {
    int x = entry.first;
    for (auto &p : entry.second) {
      p.first -= x;
      p.second -= x;
      timeSet.insert(p.first);
      timeSet.insert(p.second);
    }
  }

  map<int, int> timeToIdx;
  map<int, int> idxToTime;
  {
    int cnt = 0;
    for (int t : timeSet) {
      timeToIdx[t] = cnt;
      idxToTime[cnt] = t;
      cnt++;
    }
  }

  int NT = timeToIdx.size();

  LazySegmentTree seg(vector<int>(NT + 10, INF));
  for (auto itr = chart.rbegin(); itr != chart.rend(); itr++) {
    int x = itr->first;
    for (pll p : itr->second) {
      int bi = timeToIdx[p.first];
      int ei = timeToIdx[p.second];
      seg.update(bi, ei, x);
    }
  }

  vector<int> vt;
  for (int t : timeSet)
    vt.push_back(t);
  vt.push_back(INF);
  for (int t : D) {
    int idx = upper_bound(all(vt), t) - 1 - vt.begin();
    int x = seg.find(idx, idx + 1);
    cout << (x == INF ? -1 : x) << endl;
  }

  return 0;
}


Fixed submission:
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <immintrin.h>
#include <iostream>
#include <random>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
#endif

using namespace std;

// 呪文
#define DUMPOUT cerr
#define dump(...)                                                              \
  DUMPOUT << "  ";                                                             \
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \
          << endl;                                                             \
  DUMPOUT << "    ";                                                           \
  dump_func(__VA_ARGS__)

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t i = 0; i < v.size(); i++)
    is >> v[i];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux
template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(std::move(tail)...);
}

template <typename Ty> Ty modpow(Ty n, Ty e, Ty m) {
  Ty result = 1;
  while (e > 0) {
    if (e & 1)
      result = (result * n) % m;
    e >>= 1;
    n = (n * n) % m;
  }
  return result;
}

#define PI 3.14159265358979323846
#define EPS 1e-10
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

// #define int long long

const int INF = INT_MAX;
struct LazySegmentTree {
private:
  int n;
  vector<int> node, lazy;
  vector<bool> lazyFlag;

public:
  LazySegmentTree(vector<int> v) {
    int sz = (int)v.size();
    n = 1;
    while (n < sz)
      n *= 2;
    node.resize(2 * n - 1);
    lazy.resize(2 * n - 1, INF);
    lazyFlag.resize(2 * n - 1, false);

    for (int i = 0; i < sz; i++)
      node[i + n - 1] = v[i];
    for (int i = n - 2; i >= 0; i--)
      node[i] = min(node[i * 2 + 1], node[i * 2 + 2]);
  }

  void lazyEvaluate(int k, int l, int r) {
    if (lazyFlag[k]) {
      node[k] = lazy[k];
      if (r - l > 1) {
        lazy[k * 2 + 1] = lazy[k * 2 + 2] = lazy[k];
        lazyFlag[k * 2 + 1] = lazyFlag[k * 2 + 2] = true;
      }
      lazyFlag[k] = false;
    }
  }

  void update(int a, int b, int x, int k = 0, int l = 0, int r = -1) {
    if (r < 0)
      r = n;
    lazyEvaluate(k, l, r);
    if (b <= l || r <= a)
      return;
    if (a <= l && r <= b) {
      lazy[k] = x;
      lazyFlag[k] = true;
      lazyEvaluate(k, l, r);
    } else {
      update(a, b, x, 2 * k + 1, l, (l + r) / 2);
      update(a, b, x, 2 * k + 2, (l + r) / 2, r);
      node[k] = min(node[2 * k + 1], node[2 * k + 2]);
    }
  }

  int find(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0)
      r = n;
    lazyEvaluate(k, l, r);
    if (b <= l || r <= a)
      return INF;
    if (a <= l && r <= b)
      return node[k];
    int vl = find(a, b, 2 * k + 1, l, (l + r) / 2);
    int vr = find(a, b, 2 * k + 2, (l + r) / 2, r);
    return min(vl, vr);
  }
};

int N, Q;
vector<int> S, T, X;
vector<int> D;
struct Con {
  int s, t, x;
  Con(int s, int t, int x) : s(s), t(t), x(x) {}
};
ostream &operator<<(ostream &os, const Con &c) {
  os << "{s:" << c.s << ",t:" << c.t << ",x:" << c.x << "}";
  return os;
}
vector<Con> cons;

map<int, vector<pii>> chart;

signed main() {

  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  cin >> N >> Q;
  S.resize(N);
  T.resize(N);
  X.resize(N);
  REP(i, N) {
    cin >> S[i] >> T[i] >> X[i];
    cons.emplace_back(S[i], T[i], X[i]);
  }
  D.resize(Q);
  cin >> D;

  sort(all(cons), [&](const Con &a, const Con &b) {
    if (a.x == b.x)
      return a.s < b.s;
    return a.x < b.x;
  });

  for (auto &c : cons) {
    int x = c.x;
    int s = c.s;
    int t = c.t;
    auto &ch = chart[x];
    if (!ch.empty() && ch.back().second == s)
      ch.back().second = t;
    else
      ch.emplace_back(s, t);
  }

  set<int> timeSet;

  // conv to chart
  for (auto &entry : chart) {
    int x = entry.first;
    for (auto &p : entry.second) {
      p.first -= x;
      p.second -= x;
      timeSet.insert(p.first);
      timeSet.insert(p.second);
    }
  }

  map<int, int> timeToIdx;
  map<int, int> idxToTime;
  {
    int cnt = 0;
    for (int t : timeSet) {
      timeToIdx[t] = cnt;
      idxToTime[cnt] = t;
      cnt++;
    }
  }

  int NT = timeToIdx.size();

  LazySegmentTree seg(vector<int>(NT + 10, INF));
  for (auto itr = chart.rbegin(); itr != chart.rend(); itr++) {
    int x = itr->first;
    for (pll p : itr->second) {
      int bi = timeToIdx[p.first];
      int ei = timeToIdx[p.second];
      seg.update(bi, ei, x);
    }
  }

  vector<int> vt;
  for (int t : timeSet)
    vt.push_back(t);
  vt.push_back(INF);
  for (int t : D) {
    int idx = upper_bound(all(vt), t) - 1 - vt.begin();
    int x = seg.find(idx, idx + 1);
    cout << (x == INF ? -1 : x) << endl;
  }

  return 0;
}