제출 #1261507

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1261507		kargneq	A Huge Tower (CEOI10_tower)	C++20	0 / 100	65 ms	5332 KiB

tower

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int n;
	long long d;
	if (!(cin >> n >> d)) return 0;
	vector<long long> a(n);
	for (int i = 0; i < n; ++i) cin >> a[i];
	sort(a.begin(), a.end());

	long long MOD = 1000000009;  // uncomment if the problem statement
	// requires it
	long long ans = 1;

	int left =
		0;  // counts how many indices < right satisfy a[left] + d <= a[right]
	for (int right = 0; right < n; ++right) {
		while (left < right && a[left] + d <= a[right]) {
			++left;
		}
		// number of valid bottoms for this top is exactly 'left'
		// multiply the running product
		ans = (ans * max(0, left)) % MOD;  // if using modulo
	}

	cout << ans << '\n';
	return 0;
}

• 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