Submission #473725

#	Time	Username	Problem	Language	Result	Execution time	Memory
473725		mnair797	A Huge Tower (CEOI10_tower)	Cpython 3	95 / 100	1083 ms	64116 KiB

tower

n,d=input().split()
n=int(n)
d=int(d)
m=1000000009
blocks=[0]*n
blocks=input().split()
for i in range (n):
    blocks[i]=int(blocks[i])
blocks.sort()
towers=[0]*n
towers[0]=1
p=0
for i in range (n):
    while p<i and blocks[p]+d<blocks[i]:
        p+=1
    if i>0:
        towers[i]=(((i-p+1)) * towers[i - 1]) % m
print (towers[n - 1] % m)

 

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