Submission #71866849

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

ll op(ll a, ll b){
    return max(a, b);
}

ll e(){return -1e18;}
ll o2(ll a, ll b){
    return min(a, b);
}
ll e2(){
    return 1e18;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, q; cin >> n >> q;
    vll x(n), y(n); rep(i, n)cin >> x[i] >> y[i];
    vll z(n), w(n);
    rep(i, n){
        z[i] = x[i] - y[i];
        w[i] = x[i] + y[i];
        
    }
    segtree<ll, op, e> seg1(z), seg2(w);
    segtree<ll, o2, e2> seg3(z), seg4(w);
    while(q--){
        int j; cin >> j;
        if(j == 1){
            int i; ll a, b; cin >> i >> a >> b;
            i--;
            seg1.set(i, a-b);
            seg2.set(i, a+b);
            seg3.set(i, a-b);
            seg4.set(i, a+b);
        }else{
            int l, r; ll x, y; cin >> l >> r >>x >> y;
            l--;
            ll c = x-y, d = x+y;
            ll ans = 0;
            ans = max({abs(seg1.prod(l, r)-c), abs(seg2.prod(l, r)-d), 
                abs(seg3.prod(l, r)-c), abs(seg4.prod(l, r)-d)});
            cout << ans << endl;
        }
    }


    return 0;
}

Submission Info

Judge Result