Submission #11,295

2024-08-04 16:32:01

python3

Accepted 50/50

82ms

15012 KiB

#fire
#sor1 = '6 4 100'; sor2 = '0 70 110 210 230 500'
sor1 = input(); sor2 = input()

L1 = list(map(int, sor1.split(' '))); N, telep, tav = L1[0], L1[1], L1[2]; helyek = list(map(int, sor2.split(' ')))

ok = [telep]
utolso = telep-1
for i in range(telep-2, -1, -1):
    if helyek[utolso]-helyek[i] >= tav:
        ok += [i+1]; utolso = i

utolso = telep-1

for i in range(telep, N):
    if helyek[i]-helyek[utolso] >= tav:
        ok += [i+1]; utolso = i

ok.sort()
print(len(ok))
print(*ok)

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	17ms	3044 KiB
		2	Accepted	0/0	75ms	14760 KiB
		3	Accepted	2/2	17ms	2960 KiB
		4	Accepted	2/2	18ms	3044 KiB
		5	Accepted	2/2	17ms	3048 KiB
		6	Accepted	2/2	17ms	2904 KiB
		7	Accepted	2/2	17ms	3044 KiB
		8	Accepted	2/2	17ms	3064 KiB
		9	Accepted	2/2	21ms	3684 KiB
		10	Accepted	2/2	23ms	4068 KiB
		11	Accepted	2/2	23ms	4020 KiB
		12	Accepted	2/2	28ms	5148 KiB
		13	Accepted	2/2	29ms	5132 KiB
		14	Accepted	2/2	28ms	5092 KiB
		15	Accepted	3/3	28ms	5356 KiB
		16	Accepted	3/3	35ms	6608 KiB
		17	Accepted	3/3	41ms	7872 KiB
		18	Accepted	3/3	46ms	9048 KiB
		19	Accepted	3/3	82ms	14792 KiB
		20	Accepted	3/3	76ms	14752 KiB
		21	Accepted	4/4	81ms	14708 KiB
		22	Accepted	4/4	75ms	15012 KiB