#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("Ofast") #include #include using namespace std; #if __has_include() #include using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = unsigned long long; #define endl "\n" typedef pair Pii; #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define all(s) (s).begin(),(s).end() //#define rep2(i, m, n) for (int i = (m); i < (n); ++i) //#define rep(i, n) rep2(i, 0, n) #define PB push_back #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) //#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++) #define fi first #define se second #define pb push_back #define P pair #define NP next_permutation //const ll mod = 1000000009; const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 4100000000000000000ll; const ld eps = ld(0.00000000001); //static const long double pi = 3.141592653589793; templatevoid vcin(vector &n){for(int i=0;i>n[i];} templatevoid vcin(vector &n,vector &m){for(int i=0;i>n[i]>>m[i];} templatevoid vcout(vector &n){for(int i=0;ivoid vcin(vector> &n){for(int i=0;i>n[i][j];}}} templatevoid vcout(vector> &n){for(int i=0;iauto min(const T& a){ return *min_element(all(a)); } templateauto max(const T& a){ return *max_element(all(a)); } templatevoid print(pair a){cout<bool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b void ifmin(T t,T u){if(t>u){cout<<-1< void ifmax(T t,T u){if(t>u){cout<<-1<auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector(arg,x);else return vector(arg,make_vector(x,args...));} ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<>= 1; } return ret; } vector divisor(ll x){ vector ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; } ll pop(ll x){return __builtin_popcountll(x);} ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;} template struct Sum{ vector data; Sum(const vector& v):data(v.size()+1){ for(ll i=0;i struct Sum2{ vector> data; Sum2(const vector> &v):data(v.size()+1,vector(v[0].size()+1)){ for(int i=0;iupdateall(lval); right->updateall(lval); lval = inf; return; } if(ladd != 0) { left->addall(ladd); right->addall(ladd); ladd = 0; } if(max_v < left->max_v) { left->update_max(max_v); } if(left->min_v < min_v) { left->update_min(min_v); } if(max_v < right->max_v) { right->update_max(max_v); } if(right->min_v < min_v) { right->update_min(min_v); } } void update() { sum = left->sum + right->sum; if(left->max_v < right->max_v) { max_v = right->max_v; max_c = right->max_c; smax_v = max(left->max_v, right->smax_v); } else if(left->max_v > right->max_v) { max_v = left->max_v; max_c = left->max_c; smax_v = max(left->smax_v, right->max_v); } else { max_v = left->max_v; max_c = left->max_c + right->max_c; smax_v = max(left->smax_v, right->smax_v); } if(left->min_v < right->min_v) { min_v = left->min_v; min_c = left->min_c; smin_v = min(left->smin_v, right->min_v); } else if(left->min_v > right->min_v) { min_v = right->min_v; min_c = right->min_c; smin_v = min(left->min_v, right->smin_v); } else { min_v = left->min_v; min_c = left->min_c + right->min_c; smin_v = min(left->smin_v, right->smin_v); } } }; int n, n0; Node *root; void _update_min(ll x, int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a || nd->max_v <= x) { return; } if(a <= l && r <= b && nd->smax_v < x) { nd->update_max(x); return; } nd->push(); _update_min(x, a, b, nd->left, l, (l+r)/2); _update_min(x, a, b, nd->right, (l+r)/2, r); nd->update(); } void _update_max(ll x, int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a || x <= nd->min_v) { return; } if(a <= l && r <= b && x < nd->smin_v) { nd->update_min(x); return; } nd->push(); _update_max(x, a, b, nd->left, l, (l+r)/2); _update_max(x, a, b, nd->right, (l+r)/2, r); nd->update(); } void _add_val(ll x, int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a) { return; } if(a <= l && r <= b) { nd->addall(x); return; } nd->push(); _add_val(x, a, b, nd->left, l, (l+r)/2); _add_val(x, a, b, nd->right, (l+r)/2, r); nd->update(); } void _update_val(ll x, int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a) { return; } if(a <= l && r <= b) { nd->updateall(x); return; } nd->push(); _update_val(x, a, b, nd->left, l, (l+r)/2); _update_val(x, a, b, nd->right, (l+r)/2, r); nd->update(); } ll _query_max(int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a) { return -inf; } if(a <= l && r <= b) { return nd->max_v; } nd->push(); ll lv = _query_max(a, b, nd->left, l, (l+r)/2); ll rv = _query_max(a, b, nd->right, (l+r)/2, r); return max(lv, rv); } ll _query_min(int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a) { return inf; } if(a <= l && r <= b) { return nd->min_v; } nd->push(); ll lv = _query_min(a, b, nd->left, l, (l+r)/2); ll rv = _query_min(a, b, nd->right, (l+r)/2, r); return min(lv, rv); } ll _query_sum(int a, int b, Node *nd, int l, int r) { if(b <= l || r <= a) { return 0; } if(a <= l && r <= b) { return nd->sum; } nd->push(); ll lv = _query_sum(a, b, nd->left, l, (l+r)/2); ll rv = _query_sum(a, b, nd->right, (l+r)/2, r); return lv + rv; } public: SegmentTree(int n, vector a) : n(n) { n0 = 1; while(n0 < n) n0 <<= 1; Node *nds = new Node[2*n0]; root = nds; nds[0].len = n0; for(int i=0; i> 1); } for(int i=0; i=0; i--) nds[i].update(); } void update_min(int a, int b, ll x) { _update_min(x, a, b, root, 0, n0); } void update_max(int a, int b, ll x) { _update_max(x, a, b, root, 0, n0); } void add_val(int a, int b, ll x) { _add_val(x, a, b, root, 0, n0); } void update_val(int a, int b, ll x) { _update_val(x, a, b, root, 0, n0); } ll query_max(int a, int b) { return _query_max(a, b, root, 0, n0); } ll query_min(int a, int b) { return _query_min(a, b, root, 0, n0); } ll query_sum(int a, int b) { return _query_sum(a, b, root, 0, n0); } }; int main() { cincout(); ll n,q; cin>>n>>q; cout<<-1< k(n); SegmentTree seg(int(n),k); vector x,y,z; for(int i=0;i>a>>b>>c; a--; seg.update_max(a,b,c); x.pb(a); y.pb(b); z.pb(c); } for(int i=0;i