Submission #1178905

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178905		sosuke	A Huge Tower (CEOI10_tower)	Pypy 3	100 / 100	338 ms	157192 KiB

tower

MOD = 10**9 + 9

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

blocks.sort()  # sort the blocks

right = 0
res = 1
for left in range(n):
	while right < n - 1 and blocks[right + 1] - blocks[left] <= d:
		right += 1

	# largest tower we can built when blocks[left] block is the base
	dist = right - left + 1
	res = (res * dist) % MOD

print(res)

Compilation message (stdout)

Compiling 'tower.py'...

=======
  adding: __main__.pyc (deflated 21%)

=======

• 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