已过存疑求解

#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

typedef long long ll;
typedef long double db;
struct P{
    db l,r;
    bool operator<(const P t)const {
        if (r!=t.r) return r<t.r;
        return l<t.l;
    }
} edge[100005];
int t;
int n,m,L,V;
int ans,tot;
int d[100005],v[100005],a[100005],p[100005];

int main (){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> t;
    while (t--){
        cin >> n >> m >> L >> V;
        for (int i=1;i<=n;i++){
            cin >> d[i] >> v[i] >> a[i];
        }
        for (int i=1;i<=m;i++){
            cin >> p[i];
        }
        tot=0;
        for (int i=1;i<=n;i++){
            // if (d[i]>p[m]) continue;
            int l=1,r=m,mid;
            int pos=0;
            if (a[i]>0){
                db s=(V*V-v[i]*v[i])*1.0/(2.0*a[i]);
                while (l<=r){
                    mid=(l+r)/2;
                    if (p[mid]-d[i]>s){
                        pos=mid;
                        r=mid-1;
                    }else {
                        l=mid+1;
                    }
                }
                if (!pos) continue;
                edge[++tot].l=pos;
                edge[tot].r=m;
            }else {
                if (v[i]<=V) continue;
                while (l<=r){
                    mid=(l+r)/2;
                    if (p[mid]>=d[i]){
                        pos=mid;
                        r=mid-1;
                    }else {
                        l=mid+1;
                    }
                }
                if (!pos) continue;
                l=pos,r=m;
                int ans=0;
                while (l<=r){
                    mid=(l+r)/2;
                    db v1=sqrt(1.0*v[i]*v[i]+2.0*a[i]*(p[mid]-d[i]));
                    if (v1>V){
                        ans=mid;
                        l=mid+1;
                    }else {
                        r=mid-1;
                    }
                }
                if (ans<pos) continue;
                edge[++tot].l=pos;
                edge[tot].r=ans;
            }
        }
        cout << tot << ' ';
        sort(edge+1,edge+tot+1);
        int lst=-1;
        ans=0;
        for (int i=1;i<=tot;i++){
            if (edge[i].l<=lst) continue;
            lst=edge[i].r;
            ans++;
        }
        cout << m-ans << endl;
    }
    return 0;
}