Submission #719668

#	Time	Username	Problem	Language	Result	Execution time	Memory
719668		TAhmed33	A Huge Tower (CEOI10_tower)	C++98	5 / 100	349 ms	89476 KiB

tower

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 1e9 + 9;
int fact[10000001] = {};
int arr[10000000];
signed main () {
	fact[0] = 1;
	int n, d;
	for (int i = 1; i <= 10000000; i++) {
		fact[i] = (i * fact[i - 1]) % MOD;
	}
	cin >> n >> d;
	for (int i = 0; i < n; i++) cin >> arr[i];
	sort(arr, arr + n);
	int l = 1;
	for (int i = 0; i < n; i++) {
		int ub = upper_bound(arr, arr + n, arr[i] + d) - arr;
		ub--;
		if (ub < i) continue;
		l = (l * fact[(ub - i + 1)]) % MOD;
		i = ub;
	}
	cout << l << '\n';
}

• 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: 5 / 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