#include using namespace std; #define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__) #define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__) #define OVERLOAD_REP(_1, _2, _3, _4, name, ...) name #define REP1(n) for(ll i=0;i<(n);i++) #define REP2(i, n) for (ll i=0;i<(n);i++) #define REP3(i, a, n) for (ll i=a;i<(n);i++) #define REP4(i, a, b, n) for(ll i=a;i<(n);i+=b) #define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__) #define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name #define RREP1(n) for(ll i=(n)-1;i>=0;i--) #define RREP2(i, n) for(ll i=(n)-1;i>=0;i--) #define RREP3(i, a, n) for(ll i=(n)-1;i>=(a);i--) #define RREP4(i, a, b, n) for(ll i=(n)-1;i>=(a);i-=(b)) #define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__) #define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a)) #define len(n) (long long)(n).size() using ll = long long; using ld = long double; using ull = unsigned long long; using vi = vector; using vvi = vector; using vvvi = vector; using vll = vector; using vvll = vector; using vvvll = vector; using vs = vector; using vvs = vector; using vvvs = vector; using vld = vector; using vvld = vector; using vvvld = vector; using vc = vector; using vvc = vector; using vvvc = vector; using pll = pair; using vpll = vector; using vvpll = vector; ll intpow(ll a,ll b){ ll ans = 1; while (b){ if (b & 1){ ans *= a; } a *= a; b /= 2; } return ans; } ll modpow(ll a,ll b,ll c){ ll ans = 1; while (b){ if (b & 1){ ans *= a; ans %= c; } a *= a; a %= c; b /= 2; } return ans; } template inline T floor(T a, T b) { T q = a / b; T r = a % b; if (r != 0 && ((r < 0) != (b < 0))) q--; return q; } template inline T ceil(T a, T b) { T q = a / b; T r = a % b; if (r != 0 && ((r < 0) == (b < 0))) q++; return q; } template inline T bmod(T a, T b) { T r = a % b; if (r < 0) r += std::abs(b); return r; } template vector>> group_by_first(vector> vec) { sort(vec.begin(), vec.end(), [](auto& a, auto& b) { if (a.first != b.first) return a.first < b.first; return a.second < b.second; }); vector>> res; for (auto& p : vec) { if (res.empty() || res.back().back().first != p.first) { res.push_back({}); } res.back().push_back(p); } return res; } template void input(T&... a){ (cin >> ... >> a); } #define INT(...) int __VA_ARGS__; input(__VA_ARGS__) #define LL(...) ll __VA_ARGS__; input(__VA_ARGS__) #define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__) #define LD(...) ld __VA_ARGS__; input(__VA_ARGS__) #define STR(...) string __VA_ARGS__; input(__VA_ARGS__) #define CHA(...) char __VA_ARGS__; input(__VA_ARGS__) #define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];} #define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];} #define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];} #define VI(name,length) vi name(length);rep(i,length){cin >> name[i];} #define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];} #define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];} #define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];} #define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];} #define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];} #define VC(name,length) vc name(length);rep(i,length){cin >> name[i];} #define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];} #define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];} #define VS(name,length) vs name(length);rep(i,length){cin >> name[i];} #define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];} #define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];} #define PLL(name) pll name;cin>>name.first>>name.second; #define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;} void print(){cout << "\n";} template std::ostream& operator<<(std::ostream& os, const std::pair& p) { os << "(" << p.first << ", " << p.second << ")"; return os; } template std::ostream& operator<<(std::ostream& os, const std::vector& vec) { os << "["; for (size_t i = 0; i < vec.size(); ++i) { os << vec[i]; if (i + 1 < vec.size()) os << ", "; } os << "]"; return os; } template std::ostream& operator<<(std::ostream& os, const std::vector>& a) { os << "["; for (size_t j = 0; j < a.size(); ++j) { os << "(" << a[j].first << ", " << a[j].second << ")"; if (j + 1 < a.size()) os << ", "; } os << "]"; return os; } template std::ostream& operator<<(std::ostream& os, const std::vector>>& mat) { os << "["; for (size_t i = 0; i < mat.size(); ++i) { os << "["; for (size_t j = 0; j < mat[i].size(); ++j) { os << "(" << mat[i][j].first << ", " << mat[i][j].second << ")"; if (j + 1 < mat[i].size()) os << ", "; } os << "]"; if (i + 1 < mat.size()) os << ", "; } os << "]"; return os; } template std::ostream& operator<<(std::ostream& os, const std::set& s) { os << "{"; bool first = true; for (const auto& x : s) { if (!first) os << ", "; os << x; first = false; } os << "}"; return os; } template std::ostream& operator<<(std::ostream& os, const std::map& m) { os << "{"; bool first = true; for (const auto& [key, val] : m) { if (!first) os << ", "; os << key << ": " << val; first = false; } os << "}"; return os; } template void print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\n';} #ifdef LOCAL void debug() { std::cerr << "\n"; } template void debug(const T& a, const Ts&... b) { std::cerr << a; (std::cerr << ... << (std::cerr << ' ', b)); std::cerr << '\n'; } #else #define debug(...) (void)0 #endif void write(){cout << "\n";} template void write(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\n';} void write(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}} void write(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}} void write(vi x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}} void write(vvi x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}} void write(vvvi x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}} void write(vld x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}} void write(vvld x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}} void write(vvvld x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}} void write(vc x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}} void write(vvc x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}} void write(vvvc x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}} void write(vs x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << " ";}else{cout << '\n';}}} void write(vvs x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}} void write(vvvs x){rep(i,len(x))rep(j,len(x[i]))rep(k,len(x[i][j])){cout << x[i][j][k];if(k!=len(x[i][j])-1){cout << " ";}else if(j!=len(x[i])-1){cout << " | ";}else{cout << '\n';}}} void write(pll x){cout << x.first << ' ' << x.second << '\n';} void write(vpll x){rep(i,len(x)){cout << x[i].first << ' ' << x[i].second << '\n';}} void write(vvpll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j].first << ' ' << x[i][j].second;if(j!=len(x[i])-1){cout << " ";}else{cout << '\n';}}} template T sum(const std::vector& v) { return std::accumulate(v.begin(), v.end(), T(0)); } template auto le(const Set &s, const typename Set::value_type &x, const typename Set::value_type &ngval = typename Set::value_type(-1)) { auto it = s.upper_bound(x); if (it == s.begin()) return ngval; return *prev(it); } template auto lt(const Set &s, const typename Set::value_type &x, const typename Set::value_type &ngval = typename Set::value_type(-1)) { auto it = s.lower_bound(x); if (it == s.begin()) return ngval; return *prev(it); } template auto ge(const Set &s, const typename Set::value_type &x, const typename Set::value_type &ngval = typename Set::value_type(-1)) { auto it = s.lower_bound(x); if (it == s.end()) return ngval; return *it; } template auto gt(const Set &s, const typename Set::value_type &x, const typename Set::value_type &ngval = typename Set::value_type(-1)) { auto it = s.upper_bound(x); if (it == s.end()) return ngval; return *it; } template bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; } template bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; } template bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; } template bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; } #include #include //based on https://betrue12.hateblo.jp/entry/2020/09/23/005940 //区間加算区間最小値取得 //https://onlinejudge.u-aizu.ac.jp/status/users/hato_/submissions/1/DSL_2_H/judge/10789092/C++23 using S = long long; using F = long long; const S inf = 1LL<<60; S op(S a, S b){return min(a, b);} S e(){return inf;} S mapping(F f, S x){return f+x;} F composition(F f, F g){return f+g;} F id(){return 0;} /* //区間加算区間最大値取得 //https://onlinejudge.u-aizu.ac.jp/status/users/hato_/submissions/1/DSL_2_H/judge/10789121/C++23 using S = long long; using F = long long; const S inf = 1LL<<60; S op(S a, S b){return max(a, b);} S e(){return -inf;} S mapping(F f, S x){return f+x;} F composition(F f, F g){return f+g;} F id(){return 0;} */ /* //区間加算区間和取得 //https://onlinejudge.u-aizu.ac.jp/status/users/hato_/submissions/1/DSL_2_G/judge/10789144/C++23 struct S { long long value; int size; }; using F = long long; S op(S a, S b){return {a.value+b.value, a.size+b.size};} S e(){return {0,0};} S mapping(F f, S x){return {x.value + f*x.size, x.size};} F composition(F f, F g){return f+g;} F id(){return 0;} */ /* //区間変更区間最小値取得 //https://onlinejudge.u-aizu.ac.jp/status/users/hato_/submissions/1/DSL_2_F/judge/10789173/C++23 using S = long long; using F = long long; const S inf = 1LL<<60; const F ID = 1LL<<60; S op(S a, S b){return min(a, b);} S e(){return inf;} S mapping(F f, S x){return (f == ID ? x : f);} F composition(F f, F g){return (f == ID ? g : f);} F id(){return ID;} */ /* //区間変更区間最大値取得 //https://onlinejudge.u-aizu.ac.jp/status/users/hato_/submissions/1/DSL_2_F/judge/10789180/C++23 using S = long long; using F = long long; const S inf = 1LL<<60; const F ID = 1LL<<60; S op(S a, S b){return max(a, b);} S e(){return -inf;} S mapping(F f, S x){return (f == ID ? x : f);} F composition(F f, F g){return (f == ID ? g : f);} F id(){return ID;} */ /* //区間変更区間和取得 //https://onlinejudge.u-aizu.ac.jp/status/users/hato_/submissions/1/DSL_2_I/judge/10789215/C++23 struct S{ long long value; int size; }; using F = long long; const F ID = 1LL<<60; S op(S a, S b){return {a.value+b.value, a.size+b.size};} S e(){return {0,0};} S mapping(F f, S x){ if(f != ID){x.value = f * x.size;} return x; } F composition(F f, F g){return (f == ID ? g : f);} F id(){return ID;} */ /* //区間等差数列加算区間和取得 //https://atcoder.jp/contests/abc407/editorial/13118 //https://atcoder.jp/contests/abc407/submissions/66153988 //A_i = A_i + ai + b //初期化: {A_i,i,1} //加算: {a,b} struct S{ ll val_sum, index_sum, len; }; struct F{ ll a,b; }; S e(){return S{0,0,0};} S op(S x,S y){ return S{x.val_sum + y.val_sum, x.index_sum + y.index_sum, x.len + y.len}; } F id(){return F{0,0};} F composition(F f,F g){return F{f.a+g.a, f.b+g.b};} S mapping(F f,S x){ return S{x.val_sum + f.a*x.index_sum + f.b*x.len, x.index_sum, x.len}; } */ ll op2(ll x,ll y){ return x + y; } ll e2(){return 0LL;} int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); LL(n,m); atcoder::lazy_segtree lst(m); rep(i,m){ lst.set(i,0); } vll house(n,-1); vpll a(n); //vll b(m,0); atcoder::segtree st(m); vll rate(n,-1); rep(i,n){ LL(x,l,r); l--; r--; house[i] = i; a[i] = {l,r}; rate[i] = x; lst.apply(l,r+1,1); st.set(i,x); } ll ans = 0; rep(i,n){ auto [l,r] = a[i]; ans += rate[i] * (r-l+1) - st.prod(l,r+1); } debug(ans); LL(q); rep(i,q){ LL(x,y,u,v); x--; y--; u--; v--; ll z = house[x]; auto [l,r] = a[x]; ans -= rate[x] * (r-l+1) - st.prod(l,r+1); //debug(ans); lst.apply(l,r+1,-1); ans += lst.get(z) * rate[x]; st.set(z,0); //debug(ans); st.set(y,rate[x]); ans += rate[x] * (v-u+1) - st.prod(u,v+1); //debug(ans); ans -= lst.get(y) * rate[x]; lst.apply(u,v+1,1); house[x] = y; a[x] = {u,v}; print(ans); } }