//Time Complexity: O(N)
//Space Complexity: O(N)
#include <bits/stdc++.h>
#define endl '\n'
#define endll '*' << endl
#define endlll "&" << endl
#define ll long long
#define pii pair<ll, ll>
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define flush cout.flush
//#define int long long //fast debug
#define migmig ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace std;
int constexpr maxn = 2e5 + 15, mod = 1e9 + 7;
ll a[maxn], n, d;
ll manfi(ll pos, ll neg) {
ll res = pos - neg;
if(res < 0)
res += mod;
return res;
}
void add(ll &x, ll y, ll z) {
x += y;
if(x > mod)
x %= mod;
x += z;
if(x > mod)
x %= mod;
}
void mul(ll &ans, ll pos, ll neg) {
ll res1, res2, res3;
res1 = (ans * pos) % mod;
res2 = (ans * neg) % mod;
res3 = ans;
add(ans, manfi(res1, res2), res3);
}
void findAns() {
ll ans = 1;
sort(a, a + n);
ll p1 = 0, p2 = 0;
while(p1 < n) {
while(p2 + 1 < n && a[p2 + 1] <= a[p1] + d)
p2++;
mul(ans, p2, p1);
p1++;
}
cout << ans << endl;
}
void read_input() {
cin >> n >> d;
for(int i = 0;i < n;i++)
cin >> a[i];
}
int main(){
migmig;
//precalc();
int t = 1;//cin >> t;
while(t--){
read_input();
findAns();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |