제출 #797644

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797644		jackliy369	A Huge Tower (CEOI10_tower)	Cpython 3	80 / 100	1081 ms	73220 KiB

tower

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

ans = 1
tower = [blocks[0]]
for i in range(1, N):
    possibilities = 1
    index = 0
    first_possible = 0
    for block in tower[index:]:
        if blocks[i] <= block + D:
            possibilities += 1
            if first_possible == 0:
                index = i
                first_possible = 1
    ans *= possibilities
    tower.append(blocks[i])

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