Submission #23,941

2026-02-01 16:47:12

python3

Runtime error 46/50

74ms

14012 KiB


(n,p,k) = map(int, input().split())


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

anws = []
lastStop = vec[p-1]

for i in range(p, -1, -1):
    if lastStop-vec[i] >= k:
        anws.append(i)
        lastStop = vec[i]

anws.reverse()
anws.append(p-1)
lastStop = vec[p-1]

for i in range(p, n):
    if vec[i]-lastStop >= k:
        anws.append(i)
        lastStop = vec[i]


print(len(anws))
for i in anws:
    print(i+1, " ", sep = "", end="")

	Sum	Test	Verdict		Time	Memory
base	46/50
		1	Accepted	0/0	16ms	3060 KiB
		2	Accepted	0/0	74ms	13916 KiB
		3	Accepted	2/2	14ms	3124 KiB
		4	Runtime error	0/2	16ms	3124 KiB
		5	Accepted	2/2	16ms	2992 KiB
		6	Runtime error	0/2	16ms	3108 KiB
		7	Accepted	2/2	14ms	3124 KiB
		8	Accepted	2/2	17ms	3144 KiB
		9	Accepted	2/2	19ms	3604 KiB
		10	Accepted	2/2	21ms	3992 KiB
		11	Accepted	2/2	20ms	4148 KiB
		12	Accepted	2/2	28ms	5220 KiB
		13	Accepted	2/2	27ms	5132 KiB
		14	Accepted	2/2	25ms	5116 KiB
		15	Accepted	3/3	25ms	5244 KiB
		16	Accepted	3/3	32ms	6476 KiB
		17	Accepted	3/3	37ms	7604 KiB
		18	Accepted	3/3	43ms	8920 KiB
		19	Accepted	3/3	71ms	13924 KiB
		20	Accepted	3/3	74ms	13880 KiB
		21	Accepted	4/4	72ms	14012 KiB
		22	Accepted	4/4	59ms	13996 KiB