Submission #379367

#	Time	Username	Problem	Language	Result	Execution time	Memory
379367		54skyxenon	A Huge Tower (CEOI10_tower)	Cpython 3	90 / 100	1095 ms	78996 KiB

tower

# https://oj.uz/problem/view/CEOI10_tower
# Credits: https://usaco.guide/solutions/ceoi-10-tower?lang=cpp

n, d = map(int, input().split())
blocks = sorted(map(int, input().split()))

ans = 1
r = 0

for l in range(n):
    while r < n - 1 and blocks[l] + d >= blocks[r + 1]:
        r += 1

    ans *= r - l + 1

print(ans % 1000000009)

• 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