提出 #73240861

---

ソースコード 拡げる

import sys
from heapq import heapify, heappush, heappop, nlargest, nsmallest
from collections import Counter, defaultdict
from functools import cache, reduce
from math import inf, gcd, lcm

def solve():
    N, M = map(int,input().split())
    A = []
    for _ in range(M):
        L, R = map(int,input().split())
        A.append((L,R))
    A = sorted(A)[::-1]
    edf = []
    for t in range(1,N+1):
        while A and A[-1][0] ==t:
            heappush(edf,A.pop()[1])
        if edf: 
            if edf[0] < t:
                print("No")
                return
            heappop(edf)
        
    print("Yes" if not edf else "No")

if __name__ == "__main__":
    solve()

提出情報

ジャッジ結果