只有 76 pts，其他点都TLE了。

求大佬帮帮我卡卡常吧。

#include<bits/stdc++.h>
//#define int long long
#define N 400005
using namespace std;
namespace IO{
    char buff[1<<21],*p1=buff,*p2=buff;
    char getch(){
        return p1==p2&&(p2=((p1=buff)+fread(buff,1,1<<21,stdin)),p1==p2)?EOF:*p1++;
    }
    template<typename T>
    void read(T &x){
        char ch=getch();int fl=1;x=0;
        while(ch>'9'||ch<'0'){if(ch=='-')fl=-1;ch=getch();}
        while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getch();}
        x*=fl;
    }
    template<typename T,typename ...Args>
    void read(T &x,Args& ...args){
        read(x);read(args...);
    }
    char obuf[1<<21],*p3=obuf;
    void putch(char ch){
        if(p3-obuf<(1<<21))*p3++=ch;
        else fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=ch;
    }
    char ch[100];
    template<typename T>
    void write(T x){
        if(!x)return putch('0');
        if(x<0)putch('-'),x*=-1;
        int top=0;
        while(x)ch[++top]=x%10+48,x/=10;
        while(top)putch(ch[top]),top--;
    }
    template<typename T,typename ...Args>
    void write(T x,Args ...args){
        write(x);write(args...);
    }
    void flush(){fwrite(obuf,p3-obuf,1,stdout);}
}
using namespace IO;
int ccf, T;
long long n, m, k, D;
int X[N], Y[N], V[N];
int x[N], y[N];
long long f[N]; 
int z[N], tot;
int d[N], len;
std::vector<int>p[N];
std::map<int, int>P;
struct Tree{
    long long C[N * 4], tag[N * 4];
    inline void build(int u, int L, int R) { //清空 
	    C[u] = tag[u] = 0ll; 
	    if(L == R) return;
	    int mid = (L + R) / 2;
	    build(u * 2, L, mid);
	    build(u * 2 + 1, mid + 1, R);
    }
    inline void pushup(int u) {
        C[u] = std::max(C[u * 2], C[u * 2 + 1]);
    }
    inline void maketag(int u, int L, int R, long long x) {
        C[u] += x;
        tag[u] += x; 
    }
    inline void pushdown(int u, int L, int R) {
        int mid = (L + R) / 2;
        maketag(u * 2, L, mid, tag[u]);
        maketag(u * 2 + 1, mid + 1, R, tag[u]);
        tag[u] = 0;
    }
    inline void update(int u, int L, int R, int l, int r, long long x) {
        if(R < l || r < L) return;
        if(l <= L && R <= r) {
            maketag(u, L, R, x);
            return;
        }
        int mid = (L + R) / 2;
        pushdown(u, L, R);
        update(u * 2, L, mid, l, r, x);
        update(u * 2 + 1, mid + 1, R, l, r, x);
        pushup(u);
    }
    inline long long query(int u, int L, int R, int l, int r) {
        if(R < l || r < L) return -1e18;
        if(l <= L && R <= r) return C[u];
        int mid = (L + R) / 2;
        pushdown(u, L, R);
        return std::max(query(u * 2, L, mid, l, r), query(u * 2 + 1, mid + 1, R, l, r));
    }
}t;
inline void init() { //输入+离散化 
	read(n,m,k,D);
	tot = 0, len = 0;
	for(int i = 1; i <= m; i++) {
		read(X[i],Y[i],V[i]);
		Y[i] = X[i] - Y[i] + 1;
		swap(X[i], Y[i]);
		z[++tot] = X[i];
		z[++tot] = Y[i];
	}
	sort(z + 1, z + tot + 1);
	for(int i = 1; i <= tot; i++) {
		if(i == 1 || z[i] != z[i - 1]) d[++len] = z[i];
	}
	for(int i = 1; i <= len; i++) {
		p[i].clear();
		P[d[i]] = i;
	} 
	for(int i = 1; i <= m; i++) {
		x[i] = P[X[i]], y[i] = P[Y[i]];
		p[y[i]].push_back(i);
	} 
	t.build(1, 1, len);
}
inline void work() {
	for(int i = 1; i <= len; i++) {
		f[i] = f[i - 1];
		if(d[i] - d[i - 1] == 1) t.update(1, 1, len, i, i, (long long) (i >= 2 ? f[i - 2]: 0) + (long long) D * d[i]);
		else t.update(1, 1, len, i, i, (long long) (i >= 1 ? f[i - 1]: 0) + (long long) D * d[i]);
		for(int j = 0; j < p[i].size(); j++) {
			int y = p[i][j];
			t.update(1, 1, len, 1, x[y], V[y]);
		}
		int L = 1, mid, R = i, Get = -1;
		while(L <= R) {
			mid = (L + R) / 2;
			if(d[i] - d[mid] + 1 <= k) {
				Get = mid;
				R = mid - 1;
			}
			else L = mid + 1;
		}
		if(Get != -1)
		    f[i] = max(f[i], (long long) t.query(1, 1, len, Get, i) - (long long) D * d[i] - (long long) D);
	    
	}
}
signed main() {
    //freopen("run4.in", "r", stdin);
    read(ccf,T);
    
	while(T--) {
		init(); 
		work(); 
		write(f[len]);
		putch('\n');
		//printf("%lld\n", f[len]); 
	}
	flush();
	return 0;
}