Submission #8,854

2024-02-02 14:32:42

python3

Wrong answer 38/50

513ms

57032 KiB

N, H = [int(i) for i in input().split()]
M = [[] for i in range(N)]
K1 = []
K2 = []
for i in range(N):
    k,v = [int(i) for i in input().split()]
    M[i] = [v,k,i+1]

M.sort()

K2 = [M[0]]
R1 = 0
R2 = M[0][0]
elso = True
for m in M[1:]:
    if elso:
        if m[1] > R1:
            K1.append(m)
            R1 = m[0]
            elso = True
        elif m[1] > R2:
            K2.append(m)
            R2 = m[0]
            elso = False
    else:
        if m[1] > R2:
            K2.append(m)
            R2 = m[0]
            elso = False
        elif m[1] > R1:
            K1.append(m)
            R1 = m[0]
            elso = True

print(len(K1),len(K2))
print(*[i[-1] for i in K1])
print(*[i[-1] for i in K2])

	Sum	Test	Verdict		Time	Memory
base	38/50
		1	Accepted	0/0	18ms	11136 KiB
		2	Accepted	0/0	54ms	16008 KiB
		3	Accepted	1/1	18ms	11812 KiB
		4	Accepted	1/1	18ms	12160 KiB
		5	Accepted	2/2	17ms	12408 KiB
		6	Accepted	2/2	18ms	12620 KiB
		7	Accepted	2/2	18ms	12876 KiB
		8	Wrong answer	0/2	18ms	13156 KiB
		9	Accepted	3/3	17ms	13152 KiB
		10	Accepted	1/1	21ms	13428 KiB
		11	Accepted	1/1	20ms	13476 KiB
		12	Accepted	2/2	20ms	13532 KiB
		13	Accepted	2/2	20ms	13476 KiB
		14	Accepted	2/2	20ms	13508 KiB
		15	Wrong answer	0/2	21ms	13656 KiB
		16	Accepted	3/3	21ms	13580 KiB
		17	Accepted	2/2	449ms	54568 KiB
		18	Accepted	2/2	451ms	54552 KiB
		19	Wrong answer	0/4	500ms	54536 KiB
		20	Wrong answer	0/4	449ms	55092 KiB
		21	Accepted	4/4	507ms	54896 KiB
		22	Accepted	4/4	460ms	55156 KiB
		23	Accepted	4/4	513ms	57032 KiB