Submission #8,856

2024-02-02 14:45:00

python3

Accepted 50/50

518ms

56096 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 = []
R1 = 0
R2 = 0
elso = True
for m in M:
    if elso:
        if m[1] > R1:
            K1.append(m)
            R1 = m[0]
        elif m[1] > R2:
            K2.append(m)
            R2 = m[0]
            elso = False
    else:
        if m[1] > R2:
            K2.append(m)
            R2 = m[0]
        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	50/50
		1	Accepted	0/0	17ms	11240 KiB
		2	Accepted	0/0	52ms	15620 KiB
		3	Accepted	1/1	18ms	12008 KiB
		4	Accepted	1/1	18ms	11876 KiB
		5	Accepted	2/2	17ms	11972 KiB
		6	Accepted	2/2	17ms	12236 KiB
		7	Accepted	2/2	18ms	12368 KiB
		8	Accepted	2/2	17ms	12472 KiB
		9	Accepted	3/3	18ms	12612 KiB
		10	Accepted	1/1	20ms	13180 KiB
		11	Accepted	1/1	21ms	13356 KiB
		12	Accepted	2/2	20ms	13372 KiB
		13	Accepted	2/2	20ms	13348 KiB
		14	Accepted	2/2	20ms	13340 KiB
		15	Accepted	2/2	20ms	13644 KiB
		16	Accepted	3/3	21ms	13960 KiB
		17	Accepted	2/2	448ms	53748 KiB
		18	Accepted	2/2	460ms	53724 KiB
		19	Accepted	4/4	462ms	53680 KiB
		20	Accepted	4/4	458ms	53868 KiB
		21	Accepted	4/4	465ms	54144 KiB
		22	Accepted	4/4	474ms	54088 KiB
		23	Accepted	4/4	518ms	56096 KiB