Submission #798291

#	Time	Username	Problem	Language	Result	Execution time	Memory
798291		jackliy369	A Huge Tower (CEOI10_tower)	Cpython 3	90 / 100	1077 ms	72920 KiB

tower

N, D = map(int, input().split())
blocks = sorted(list(map(int, input().split())))


# def binary_search(l, r, size, list):
#     ans = r + 1
#     while r >= l:
#         m = (l + r) // 2
#         # m = l + floor(log10(r - l + 1))
#         # m = l + (r - l) // 1000000
#         if size <= list[m] + D:
#             r = m - 1
#             ans = m
#         else:
#             l = m + 1
#     return ans

ans = 1
index = 0
for i in range(1, N):
    while index < i and blocks[i] > blocks[index] + D:
        index += 1
    ans *= (i - index + 1) % 1000000009

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