제출 #1329368

#제출 시각아이디문제언어결과실행 시간메모리
1329368nhtlongcsA Huge Tower (CEOI10_tower)Pypy 3
100 / 100
334 ms163796 KiB
n, d = map(int,input().split())

a = list(map(int, input().split()))

a.sort()

MOD = int(1e9) + 9

ans = 1
s = 0
# print(a)
for i in range(n):
    c = 0
    # print('---')
    for j in range(s, i+1):
        if a[i] - a[j] > d:
            s = j
        else:
            break
    if a[i] - a[s] > d:
        s += 1
    ans = (ans * ((i-s) + 1)) % MOD
    
print(ans)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'tower.py'...

=======
  adding: __main__.pyc (deflated 24%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...