Submission #823593

#	Time	Username	Problem	Language	Result	Execution time	Memory
823593		jackliy369	A Huge Tower (CEOI10_tower)	Cpython 3	95 / 100	1087 ms	75948 KiB

tower

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

def binary_search_i(l, r, size, list):
    ans = r + 1
    while r >= l:
        m = (l + r) // 2
        # m = l + floor(log10(r - l + 1))
        # m = l + (r - l) // 1000000
        if size <= list[m] + D:
            r = m - 1
            ans = m
        else:
            l = m + 1
    return ans

def binary_search_j(l, r, size, list):
    ans = r + 1
    while r >= l:
        m = (l + r) // 2
        if list[m] > size + D:
            r = m - 1
            ans = m
        else:
            l = m + 1
    return ans

def multiply(a, n):
    if n == 2:
        return a << 1
    elif n == 3:
        return a + (a << 1)
    elif n == 4:
        return a << 2
    elif n == 5:
        return a + (a << 2)
    elif n == 6:
        return (a << 1) + (a << 2)
    elif n == 7:
        return (a << 3) - a
    elif n == 8:
        return a << 3
    elif n == 9:
        return a + (a << 3)
    elif n == 10:
        return (a << 1) + (a << 3)
    elif n == 11:
        return a + (a << 1) + (a << 3)
    elif n == 12:
        return (a << 2) + (a << 3)
    elif n == 13:
        return a + (a << 2) + (a << 3)
    elif n == 14:
        return (a << 4) - (a << 1)
    elif n == 15:
        return (a << 4) - a
    else:
        return a * n

ans = 1
i = 0
j = 1
while j < N:
    prev_j = j
    # while i < j and blocks[j] > blocks[i] + D:
    #     i += 1
    i = binary_search_i(i, j - 1, blocks[j], blocks)
    if i < j:
        j = binary_search_j(prev_j, N - 1, blocks[i], blocks)
        for k in range(prev_j, j):
            n = k - i + 1
            if n == 2:
                ans = ans << 1
            elif n == 3:
                ans = ans + (ans << 1)
            elif n == 4:
                ans = ans << 2
            elif n == 5:
                ans = ans + (ans << 2)
            elif n == 6:
                ans = (ans << 1) + (ans << 2)
            elif n == 7:
                ans = (ans << 3) - ans
            elif n == 8:
                ans = ans << 3
            elif n == 9:
                ans = ans + (ans << 3)
            elif n == 10:
                ans = (ans << 1) + (ans << 3)
            elif n == 11:
                ans = ans + (ans << 1) + (ans << 3)
            elif n == 12:
                ans = (ans << 2) + (ans << 3)
            elif n == 13:
                ans = ans + (ans << 2) + (ans << 3)
            elif n == 14:
                ans = (ans << 4) - (ans << 1)
            elif n == 15:
                ans = (ans << 4) - ans
            else:
                ans *= n
            if ans > 2000000000:
                ans = ans % 1000000009
    else:
        j += 1
    

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