Submission #1097923

#	Time	Username	Problem	Language	Result	Execution time	Memory
1097923		sosuke	A Huge Tower (CEOI10_tower)	Pypy 3	30 / 100	223 ms	103320 KiB

tower

MOD = 10**9 + 7

n, d = map(int, input().split())
ar = list(map(int, input().split()))
ar.sort()  # sort the blocks
r = 0
sol = 1
for l in range(n):
    while r < n - 1 and ar[r + 1] - ar[l] <= d:
        r += 1
    dist = r - l + 1  # largest tower we can build when ar[l] block is the base
    sol = (sol * dist) % MOD
    
print(sol)

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 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