Submission #823578

# Submission time Handle Problem Language Result Execution time Memory
823578 2023-08-12T19:15:22 Z jackliy369 A Huge Tower (CEOI10_tower) Python 3
0 / 100
933 ms 75844 KB
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

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):
            if (k - i + 1) == 2:
                ans << 1
            elif (k - i + 1) == 4:
                ans << 2
            elif (k - i + 1) == 8:
                ans << 3
            else:
                ans *= (k - i + 1)
            if ans > 2000000000000000000:
                ans = ans % 1000000009
    else:
        j += 1
    

print(ans % 1000000009)
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 2916 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2948 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 2924 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2944 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2900 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 3028 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 2868 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 3056 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 21 ms 3156 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 4100 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 174 ms 8488 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 933 ms 30580 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 600 ms 75844 KB Output isn't correct
2 Halted 0 ms 0 KB -