제출 #797708

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

tower

from math import floor, log2, sqrt


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(sqrt(r - l + 1))
        m = l + (r - l) // 4
        if size <= list[m] + D:
            r = m - 1
            ans = m
        else:
            l = m + 1
    return ans

ans = 1
tower = [blocks[0]]
index = 0
for i in range(1, N):
    possibilities = 1
    index = binary_search(index, len(tower) - 1, blocks[i], tower)
    possibilities += len(tower) - index
    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: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5