Submission #1237836

#TimeUsernameProblemLanguageResultExecution timeMemory
1237836luminescentA Huge Tower (CEOI10_tower)C++20
30 / 100
164 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 l = 0; for (long long r = 0; r < n; r++) { while (arr[r]-arr[l] > k) { l++; } output *= (r-l+1); output %= 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...