Submission #12,360

2024-12-13 10:38:39

A lehető legkevesebb átszállás (50 pont)

python3

Time limit exceeded 38/50

300ms

4664 KiB

n,m = map(int,input().split())
lista = []
for i in range(n):
    tol,ig = map(int,input().split())
    lista.append([tol,ig])
lehet = True
vonat = []
aktallomas = m
while lehet and aktallomas > 1:
    lehet = False
    kezdet = aktallomas
    for i in range(n):
        if lista[i][1] >= aktallomas and lista[i][0] < kezdet:
            aktvonat = i
            kezdet = lista[i][0]
            lehet = True
    if lehet:
        vonat.append(aktvonat)
        aktallomas = kezdet
if lehet:
    print(len(vonat)-1)
    for i in range(len(vonat)-1,-1,-1):
        print(vonat[i]+1,end=" ")
else:
    print(-1)

	Sum	Test	Verdict		Time	Memory
base	38/50
		1	Accepted	0/0	16ms	3152 KiB
		2	Time limit exceeded	0/0	282ms	4404 KiB
		3	Accepted	1/1	16ms	3128 KiB
		4	Accepted	1/1	16ms	3320 KiB
		5	Accepted	2/2	16ms	3132 KiB
		6	Accepted	2/2	14ms	3032 KiB
		7	Accepted	2/2	20ms	3060 KiB
		8	Accepted	2/2	23ms	3196 KiB
		9	Accepted	2/2	28ms	3384 KiB
		10	Accepted	2/2	41ms	3384 KiB
		11	Accepted	2/2	104ms	3536 KiB
		12	Accepted	2/2	101ms	3760 KiB
		13	Accepted	2/2	26ms	3260 KiB
		14	Accepted	2/2	56ms	3384 KiB
		15	Accepted	2/2	93ms	3520 KiB
		16	Accepted	2/2	129ms	3896 KiB
		17	Time limit exceeded	0/2	296ms	4164 KiB
		18	Time limit exceeded	0/2	300ms	4332 KiB
		19	Time limit exceeded	0/2	277ms	4212 KiB
		20	Time limit exceeded	0/2	300ms	4240 KiB
		21	Time limit exceeded	0/2	284ms	4412 KiB
		22	Time limit exceeded	0/2	300ms	4408 KiB
		23	Accepted	2/2	41ms	4664 KiB
		24	Accepted	2/2	41ms	4500 KiB
		25	Accepted	2/2	39ms	4664 KiB
		26	Accepted	2/2	43ms	4640 KiB
		27	Accepted	2/2	43ms	4664 KiB
		28	Accepted	2/2	39ms	4412 KiB