Submission #1262898

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262898		ermiooo158	A Huge Tower (CEOI10_tower)	C++20	90 / 100	44 ms	1864 KiB

tower

#include <iostream>
#include <algorithm>
using namespace std;

int const maxn = 2e5 + 15, mod = 1e9 + 9;
long long int a[maxn], n, d;

void findAns() {
	
}

void read_input() {

}

int main(){
	//migmig;
	//precalc();
	//int t = 1;//cin >> t;
	//while(t--){
		cin >> n >> d;
	for(int i = 0;i < n;i++)
		cin >> a[i];
	long long int ans = 1;
	sort(a, a + n);
	long long int p1 = 0, p2 = 0;
	while(p1 < n) {
		while(p2 + 1 < n && a[p2 + 1] <= a[p1] + d)
			p2++;
		int val = p2 - p1 + 1;
		ans = (long long int)(1LL * ans * val) % mod;
		p1++;
	}
	cout << ans << endl;
	//}
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5