Submission #852895

#	Time	Username	Problem	Language	Result	Execution time	Memory
852895		iamjiamingliu	A Huge Tower (CEOI10_tower)	Cpython 3	100 / 100	863 ms	81340 KiB

tower

import sys
import bisect

MOD = 10 ** 9 + 9

_, diff = map(int, input().split())
nums = list(map(int, sys.stdin.readline().strip().split()))
nums.sort()

ways = [0] * (len(nums) + 1)
ways[0] = 1

for i, n in enumerate(nums):
    positions = i - bisect.bisect_left(nums, n - diff) + 1
    ways[i + 1] = (ways[i] * positions) % MOD

print(ways[-1])

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