Submission #1262899

#	Time	Username	Problem	Language	Result	Execution time	Memory
1262899		ermiooo158	A Huge Tower (CEOI10_tower)	C++20	0 / 100	1096 ms	5188 KiB

tower

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

const int mod = 1e9 + 9;

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

	cout << ans << endl;
}

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