csp-s T2 90分求助

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

typedef double db;

const int N = 100005;

int n, m, L, V;
int d[N], v[N], a[N];
int p[N];

bool cmp(pair<int, int> x, pair<int, int> y) {
	if (x.second != y.second) return x.second < y.second;
	return x.first < y.first;
}

int main() {
	freopen("detect.in", "r", stdin);
	freopen("detect.out", "w", stdout);
	int T;
	cin >> T;
	while (T--) {
		cin >> n >> m >> L >> V;
		for (int i = 1; i <= n; i++)
			scanf("%d%d%d", &d[i], &v[i], &a[i]);
		for (int i = 1; i <= m; i++)
			scanf("%d", &p[i]);
			
		vector<pair<int, int> > vec;
		int cnt = 0, l, r, rr;
		for (int i = 1; i <= n; i++) {
			if (a[i] == 0) {
				if (v[i] > V && d[i] <= p[m]) {
					l = lower_bound(p + 1, p + m + 1, d[i]) - p, r = m;
					if (l <= r) cnt++, vec.push_back(make_pair(l, r));
				}
			} else if (a[i] < 0) {
				if (v[i] > V && d[i] <= p[m]) {
					db s = (db)(V * V - v[i] * v[i]) / (2 * a[i]);
					l = lower_bound(p + 1, p + m + 1, d[i]) - p;
					r = lower_bound(p + 1, p + m + 1, s + d[i]) - p - 1;
					if (l <= r) cnt++, vec.push_back(make_pair(l, r));
				}
			} else {
				if (v[i] * v[i] + 2 * a[i] * p[m] > V && d[i] <= p[m]) {
					db s = (db)(V * V - v[i] * v[i]) / (2 * a[i]);
					l = upper_bound(p + 1, p + m + 1, s + d[i]) - p;
					r = m;
					if (l <= r) cnt++, vec.push_back(make_pair(l, r));
				}
			}
		}
		cout << cnt << ' ';
		cnt = rr = 0;
		sort(vec.begin(), vec.end(), cmp);
		for (auto i : vec) {
			if (i.first > rr) cnt++, rr = i.second;
		}
		cout << m - cnt << endl;
	}
	return 0;
}