Submission #17,533

2025-07-18 11:48:53

pypy3

Wrong answer 4/40

109ms

50932 KiB

# UUID: bc7e990f-47f9-407b-9679-725b83f08ad3
from collections import deque

n, k = map(int, input().split())
heights = list(map(int, input().split()))
dq = deque()

for i in range(n):
    while dq and dq[0] < i - k:
        dq.popleft()
    while dq and heights[dq[-1]] <= heights[i]:
        dq.pop()
    if not dq:
        print(i + 1)
        break
    dq.append(i)
else:
    print(-1)

	Sum	Test	Verdict		Time	Memory
base	4/40
		1	Wrong answer	0/0	52ms	21436 KiB
		2	Wrong answer	0/0	61ms	21872 KiB
		3	Wrong answer	0/2	48ms	21412 KiB
		4	Wrong answer	0/2	48ms	21488 KiB
		5	Accepted	2/2	48ms	21476 KiB
		6	Wrong answer	0/2	54ms	21484 KiB
		7	Wrong answer	0/2	48ms	21492 KiB
		8	Wrong answer	0/2	59ms	21736 KiB
		9	Accepted	2/2	52ms	21868 KiB
		10	Wrong answer	0/2	59ms	21876 KiB
		11	Wrong answer	0/2	59ms	21744 KiB
		12	Wrong answer	0/2	50ms	21784 KiB
		13	Wrong answer	0/2	71ms	35856 KiB
		14	Wrong answer	0/2	83ms	35360 KiB
		15	Wrong answer	0/2	103ms	46832 KiB
		16	Wrong answer	0/2	89ms	47932 KiB
		17	Wrong answer	0/2	93ms	50932 KiB
		18	Wrong answer	0/2	109ms	50876 KiB
		19	Wrong answer	0/2	93ms	50932 KiB
		20	Wrong answer	0/2	79ms	34088 KiB
		21	Wrong answer	0/2	89ms	46776 KiB
		22	Wrong answer	0/2	105ms	50776 KiB