| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 726413 | 2023-04-18T21:36:05 Z | professionalACer | A Huge Tower (CEOI10_tower) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 9;
int main() {
int N, D;
cin >> N >> D;
int A[N];
for (auto &x : A) cin >> x;
sort(A, A + N);
int p = 0, ans = 1;
for (int i = 0; i < N; i++) {
while (p < N - 1 && A[p + 1] - A[i] <= D) p++;
int d = p - i + 1;
ans = (ans * d) % mod;
}
cout << ans << endl;
}