Submission #809194

# Submission time Handle Problem Language Result Execution time Memory
809194 2023-08-05T20:40:48 Z jackliy369 A Huge Tower (CEOI10_tower) Python 3
95 / 100
1000 ms 81252 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):
            ans = (ans * (k - i + 1)) % 1000000009
    else:
        j += 1
    

print(ans % 1000000009)
# Verdict Execution time Memory Grader output
1 Correct 10 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2856 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2912 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2920 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 10 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2896 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2816 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 13 ms 3028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 20 ms 3148 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 4052 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 164 ms 8456 KB Output is correct
2 Correct 65 ms 8456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 789 ms 30540 KB Output is correct
2 Correct 171 ms 33044 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 389 ms 73016 KB Output is correct
2 Execution timed out 1041 ms 81252 KB Time limit exceeded
3 Halted 0 ms 0 KB -