90pts #10 WA 求调

#include <bits/stdc++.h>
using namespace std;

struct car {
    long long d, v, a;
} cr[100005];

struct query {
    long long l, r;
    bool operator <(const query &b){
        if (r != b.r) return r < b.r;
        return l < b.l;
    }
} q[100005];

long long T, n, m, L, V, p[100005], z, ans;

long long findl(long long c, long long y){
    long long mx = cr[c].v * cr[c].v + 2 * cr[c].a * (p[m] - cr[c].d);
    if (mx <= V * V) return -1;
    long long l = y, r = m + 1;
    while (l + 1 < r){
        long long mid = l + r >> 1;
        long long f = cr[c].v * cr[c].v + 2 * cr[c].a * (p[mid] - cr[c].d);
        if (f <= V * V) l = mid;
        else r = mid;
    }
    return l;
}

long long findr(long long c, long long y){
    long long mx = cr[c].v * cr[c].v + 2 * cr[c].a * (p[y] - cr[c].d);
    if (mx <= V * V) return -1;
    long long l = y, r = m + 1;
    while (l + 1 < r){
        long long mid = l + r >> 1;
        long long f = cr[c].v * cr[c].v + 2 * cr[c].a * (p[mid] - cr[c].d);
        if (f > V * V) l = mid;
        else r = mid;
    }
    if (cr[c].v * cr[c].v + 2 * cr[c].a * (p[l] - cr[c].d) > V * V) return l;
    return -1;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> T;
    while (T--){
        cin >> n >> m >> L >> V; z = 0;
        for (int i = 1; i <= n; i++){
            cin >> cr[i].d >> cr[i].v >> cr[i].a;
        }
        for (int i = 1; i <= m; i++){
            cin >> p[i];
        }
        p[m+1] = 1e9; 
        for (int i = 1; i <= n; i++){
            long long k = lower_bound(p+1, p+m+2, cr[i].d) - p;
            if (k > m) continue;
            if (cr[i].a == 0){
                if (cr[i].v > V){
                    q[++z].l = k;
                    q[z].r = m;
                }
            }
            else if (cr[i].a > 0){
                long long tmp = findl(i, k);
                if (tmp == -1) continue;
                q[++z].l = tmp;
                q[z].r = m;
            }
            else {
                long long tmp = findr(i, k);
                if (tmp == -1) continue;
                q[++z].l = k;
                q[z].r = tmp;
            }
        }
        cout << z << " ";
        sort(q+1, q+z+1); ans = 0;
        long long lst = 0;
        for (int i = 1; i <= z; i++){
            if (q[i].l <= lst && lst <= q[i].r) continue;
            ans++; lst = q[i].r;
        }
        cout << m - ans << endl;
    }
}