oj.uz

Submission #797717

# Submission time Handle Problem Language Result Execution time Memory
797717 2023-07-29T19:43:14 Z jackliy369 A Huge Tower (CEOI10_tower) Python 3
90 / 100
 1000 ms 72992 KB 
from math import floor, log2, sqrt, log10


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(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

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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2876 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2772 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2772 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2872 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2848 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2900 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 2792 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2808 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2848 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2860 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2900 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2856 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2968 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3028 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 4020 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 8328 KB Output is correct
2 Correct 574 ms 8328 KB Output is correct

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1072 ms 30612 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 72992 KB Time limit exceeded
2 Halted 0 ms 0 KB -