Submission #1237860

#TimeUsernameProblemLanguageResultExecution timeMemory
1237860luminescentA Huge Tower (CEOI10_tower)C++17
30 / 100
169 ms5260 KiB
// Source: https://usaco.guide/general/io #include <bits/stdc++.h> using namespace std; int main() { long long n, k; cin >> n >> k; long long arr[n]; long long mod = 10e9+9; for (long long i =0 ; i< n; i++) { cin >> arr[i]; } // sort(arr, arr+n); // long long output = 1; long long r = 0; for (long long l = 0; l < n; l++) { while (r < n-1 && arr[r+1]-arr[l] <= k) { r++; } int diff = r-l+1; output = (output*diff*1LL) % mod; } cout << output; }
#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...