Submission #1241135

#TimeUsernameProblemLanguageResultExecution timeMemory
1241135papauloA Huge Tower (CEOI10_tower)C++20
100 / 100
94 ms5192 KiB
#include <bits/stdc++.h> using namespace std; #define MAXN 10001000 typedef long long ll; ll arr[MAXN]; const ll MOD = 1e9L+9LL; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll n, d; cin >> n >> d; for(ll i=0;i<n;i++) cin >> arr[i]; sort(arr, arr+n); ll ans=1; for(ll i=0;i<n;i++) { ll j=lower_bound(arr, arr+n, arr[i]-d)-arr; ans*=(i-j+1); ans%=MOD; } cout << ans << endl; return 0; }
#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...