Submission #9,431

2024-02-21 16:51:45

python3

Wrong answer 23/50

68ms

35260 KiB

def main():
    N, S, T = map(int, input().split())
    loc = list(map(int, input().split()))

    target = N-S
    loc = loc[::-1]

    ans = [N]
    last = loc[0]
    for i in range(1, N):
        if last-T >= loc[i]:
            if i+1 == target and loc[i]-T <= loc[i+1]:
                continue
            ans.append(N-i)
            last = loc[i]

    print(len(ans))
    print(*sorted(ans))

main()

	Sum	Test	Verdict		Time	Memory
base	23/50
		1	Accepted	0/0	17ms	11240 KiB
		2	Wrong answer	0/0	65ms	33152 KiB
		3	Accepted	2/2	17ms	11308 KiB
		4	Accepted	2/2	18ms	11684 KiB
		5	Accepted	2/2	17ms	12060 KiB
		6	Accepted	2/2	17ms	12260 KiB
		7	Wrong answer	0/2	17ms	12048 KiB
		8	Partially correct	1/2	17ms	12672 KiB
		9	Partially correct	1/2	20ms	14036 KiB
		10	Accepted	2/2	21ms	14224 KiB
		11	Wrong answer	0/2	21ms	14576 KiB
		12	Partially correct	1/2	27ms	16612 KiB
		13	Wrong answer	0/2	26ms	16732 KiB
		14	Partially correct	1/2	26ms	16764 KiB
		15	Partially correct	1/3	26ms	17244 KiB
		16	Wrong answer	0/3	32ms	19520 KiB
		17	Partially correct	1/3	37ms	21880 KiB
		18	Accepted	3/3	43ms	24820 KiB
		19	Wrong answer	0/3	68ms	34924 KiB
		20	Wrong answer	0/3	64ms	35036 KiB
		21	Accepted	4/4	68ms	35020 KiB
		22	Wrong answer	0/4	65ms	35260 KiB