Submission #1367176

#TimeUsernameProblemLanguageResultExecution timeMemory
1367176sbalushevA Huge Tower (CEOI10_tower)C++20
0 / 100
120 ms2836 KiB
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 9;
int main() {
    int n, d;
    cin >> n >> d;
    vector <int> v (n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }
    int ans = 1;
    for (int left = 0, right = 0; left < n; left++) {
        while (right < n - 1 && v[right + 1] - v[left] <= d) {
            right++;
        }


        ans = (ans * (right - left + 1)) % MOD;
    }

    cout << ans << endl;

}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...