提出 #73369588

ソースコード 拡げる

from heapq import heappop,heappush

N,M = list(map(int,input().split()))

peo = []
for i in range(M):
    L,R  =list(map(int,input().split()))
    heappush(peo,(L,R))

cnt = 0
now = 0
next = []

while True:
    while peo:
        l,r = heappop(peo)
        if l <= now+1:
            heappush(next,-r)
        else:
            heappush(peo,(l,r))
            break

    flg = True
    while next:
        nex = heappop(next)
        if now < -nex:
            now = -nex
            cnt += 1
            flg = False
    if flg and len(next) == 0:
        break

if N <= now:
    print(cnt)
else:
    print(-1)

提出情報

提出日時
問題 D - 警備員の配置
ユーザ june193
言語 Python (PyPy 3.11-v7.3.20)
得点 400
コード長 653 Byte
結果 AC
実行時間 457 ms
メモリ 134992 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 64
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 48 ms 82156 KiB
in02.txt AC 48 ms 82396 KiB
in03.txt AC 47 ms 82196 KiB
in04.txt AC 46 ms 82064 KiB
in05.txt AC 53 ms 91272 KiB
in06.txt AC 47 ms 82252 KiB
in07.txt AC 47 ms 82192 KiB
in08.txt AC 77 ms 109052 KiB
in09.txt AC 241 ms 122988 KiB
in10.txt AC 381 ms 126604 KiB
in11.txt AC 348 ms 126580 KiB
in12.txt AC 431 ms 134992 KiB
in13.txt AC 346 ms 125928 KiB
in14.txt AC 269 ms 132944 KiB
in15.txt AC 341 ms 126196 KiB
in16.txt AC 345 ms 126696 KiB
in17.txt AC 322 ms 125928 KiB
in18.txt AC 225 ms 122724 KiB
in19.txt AC 49 ms 81932 KiB
in20.txt AC 402 ms 127152 KiB
in21.txt AC 431 ms 127788 KiB
in22.txt AC 49 ms 82220 KiB
in23.txt AC 48 ms 82308 KiB
in24.txt AC 47 ms 82220 KiB
in25.txt AC 46 ms 82104 KiB
in26.txt AC 46 ms 82160 KiB
in27.txt AC 346 ms 126412 KiB
in28.txt AC 49 ms 82220 KiB
in29.txt AC 48 ms 82156 KiB
in30.txt AC 48 ms 82520 KiB
in31.txt AC 47 ms 82220 KiB
in32.txt AC 47 ms 82236 KiB
in33.txt AC 47 ms 82160 KiB
in34.txt AC 46 ms 82364 KiB
in35.txt AC 46 ms 82064 KiB
in36.txt AC 46 ms 82220 KiB
in37.txt AC 47 ms 82260 KiB
in38.txt AC 457 ms 127992 KiB
in39.txt AC 402 ms 127116 KiB
in40.txt AC 319 ms 125812 KiB
in41.txt AC 53 ms 88980 KiB
in42.txt AC 51 ms 83472 KiB
in43.txt AC 405 ms 127000 KiB
in44.txt AC 427 ms 133172 KiB
in45.txt AC 50 ms 81932 KiB
in46.txt AC 49 ms 82192 KiB
in47.txt AC 47 ms 82236 KiB
in48.txt AC 47 ms 82132 KiB
in49.txt AC 46 ms 81912 KiB
in50.txt AC 46 ms 82252 KiB
in51.txt AC 46 ms 82396 KiB
in52.txt AC 46 ms 82332 KiB
in53.txt AC 338 ms 133092 KiB
in54.txt AC 334 ms 132688 KiB
in55.txt AC 49 ms 82236 KiB
in56.txt AC 48 ms 82136 KiB
in57.txt AC 47 ms 82252 KiB
in58.txt AC 47 ms 82316 KiB
in59.txt AC 48 ms 81932 KiB
in60.txt AC 48 ms 82204 KiB
in61.txt AC 47 ms 82220 KiB
sample01.txt AC 47 ms 82120 KiB
sample02.txt AC 46 ms 82160 KiB
sample03.txt AC 46 ms 82332 KiB