제출 #1150429

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1150429		codelikeagi	A Huge Tower (CEOI10_tower)	Pypy 3	100 / 100	389 ms	158272 KiB

tower

MOD = 10**9 + 9

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

blocks.sort()  # Sort side lengths in non-decreasing order

dp = 1         # dp will hold the running product of valid "insert positions"
p = 0          # p is the left pointer for our sliding window

for i in range(n):
    # Move p so that blocks[i] - blocks[p] <= d
    while blocks[i] - blocks[p] > d:
        p += 1
    # c = how many blocks from p..(i-1) can be "above" this block
    c = i - p
    # We can insert the new block in (c+1) ways among those
    dp = (dp * (c + 1)) % MOD

print(dp % MOD)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'tower.py'...

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

=======

• 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