Järjestys

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define M 1000000007
#define N (1<<18)
 
using namespace std;
 
int n, x;
 
int QAQ1(vector<int> &v) {
	sort(v.begin(), v.end());
	ll ans = 1;
	ll cnt = 0;
	queue<int> q;
	for(int i=0; i<n; i++) {
		cnt++;
		q.push(v[i]);
		while(!q.empty() && v[i] - q.front() > x) {
			cnt--;
			q.pop();
		}
		ans *= cnt;
		ans %= M;
	}
	return ans;
}
 
int main() {
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio();
	int t;
	cin >> t;
	for(int g=0; g<t; g++) {
		cin >> n >> x;
		vector<int> v;
		for(int i=0; i<n; i++) {
			int f;
			cin >> f;
			v.push_back(f);
		}
		cout << QAQ1(v) << "\n";
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED