捞一下求助

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, q;
int FT_d[10000005];
int FT_e[10000005];
int lowbit(int x){return (x & -x);}
void add(int x, int y) {
    int k = x * y;
    while(x <= n) {
        FT_d[x] += y;
        FT_e[x] += k;
        x += lowbit(x);
    }
}
int query(int *FT, int x) {
    int ans = 0;
    while(x > 0) {
        ans += FT[x];
        x -= lowbit(x);
    }
    return ans;
}
void modify(int l, int r, int x){
    add(l, x);
    add(r + 1, -x);
}
#define endl '\n'
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> q;
    while(q--) {
        int l, r, s, e;
        cin >> l >> r >> s >> e;
        int d = (e - s) / (r - l);
        modify(l, l, s);
        modify(l + 1, r, d);
        modify(r + 1, r + 1, -s - (r - l) * d);
    }
    int now = 0, maxx = -1;
    for(int i = 1; i <= n; i++){
        int l = i, r = i;
        int a = (r + 1ll) * query(FT_d, r);
        int b = 1ll * l * query(FT_d, l - 1);
        int c = query(FT_e, r) - query(FT_e, l - 1);
        now ^= (a - b - c);
        maxx = max(maxx, (a - b - c));
    }
    cout << now << " " << maxx << endl;
    return 0;
}