Submission #394153

#TimeUsernameProblemLanguageResultExecution timeMemory
394153aaronhmaA Huge Tower (CEOI10_tower)C++17
100 / 100
129 ms5068 KiB
#include <bits/stdc++.h>

using namespace std;

#define MOD 1000000009
#define ll long long

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  ll n, d, j = 0, ans = 1;
  cin >> n >> d;

  vector<ll> arr(n);
  
  for (int i = 0; i < n; i++)
    cin >> arr[i];

sort(arr.begin(), arr.end());
  
  for (int i = 0; i < n; i++) {
	  while (j < n && arr[j] - arr[i] <= d) j++;
	  ans *= j - i;
	  ans %= MOD;
  }

  cout << ans << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...