Submission #1220904

#TimeUsernameProblemLanguageResultExecution timeMemory
1220904AlgorithmWarriorA Huge Tower (CEOI10_tower)C++20
100 / 100
187 ms4516 KiB
#include <bits/stdc++.h>

using namespace std;

int const MOD=1000000009;
vector<int>v;
int n,d;

int main()
{
    cin>>n>>d;
    int i;
    for(i=1;i<=n;++i){
        int val;
        cin>>val;
        v.push_back(val);
    }
    sort(v.begin(),v.end());
    int rez=1;
    int id=0;
    for(i=0;i<n;++i){
        while(v[id]<v[i]-d)
            ++id;
        rez=1LL*rez*(i-id+1)%MOD;
    }
    cout<<rez;
    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...