Submission #1295736

#TimeUsernameProblemLanguageResultExecution timeMemory
1295736Jawad_Akbar_JJA Huge Tower (CEOI10_tower)C++20
100 / 100
211 ms2844 KiB
#include <iostream>
#include <algorithm>

using namespace std;
int a[1<<20];

int main(){
	int n, d, mod =  1e9 + 9;
	cin>>n>>d;

	for (int i=1;i<=n;i++)
		cin>>a[i];
	sort(a + 1, a + n + 1);

	int wys = 1;
	for (int i=1, l=1;i<=n;i++){
		while (l < i and a[l] + d < a[i])
			l++;
		wys = 1LL * wys * (i - l + 1) % mod;
	}
	cout<<wys<<'\n';
}
#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...