提出 #75671838

---

ソースコード 拡げる

n,m=map(int,input().split())
lto=[[] for i in range(n)]
rto=[[] for i in range(n)]
from collections import defaultdict
dictcount=defaultdict(int)
for i in range(m):
    l,r=map(lambda x:int(x)-1,input().split())
    dictcount[(l,r)]+=1



    lto[l].append(r)
    rto[r].append(l)
for i in range(n):
    lto[i].sort()
    rto[i].sort()
qer=int(input())

def nibtan_sr(s,t):
    ok=-1
    ng=len(lto[s])
    while abs(ok-ng)>1:
        mid=(ok+ng)//2
        if lto[s][mid]<=t:
            ok=mid
        else:
            ng=mid
    if ok==-1:
        return None
    return lto[s][ok]
def nibtan_sl(s,t):
    ng=-1
    ok=len(rto[t])
    while abs(ok-ng)>1:
        mid=(ok+ng)//2
        if rto[t][mid]>=s:
            ok=mid
        else:
            ng=mid
    if ok==len(rto[t]):
        return None
    return rto[t][ok]
dp=[0 for i in range(n)]
def syakutori():
    r=0
    aaa=False
    for i in range(n):
        aaa=False
        while aaa==False:
            if not r<n:
                break
            if rto[r] and  rto[r][-1]>=i:
                aaa=True
            else:
                r+=1
        if aaa:
            dp[i]=r
        else:
            dp[i]=n+1



        

        

def check(s,t):
    if dictcount[(s,t)]>=2:
        print("Yes")
        return 
    if dp[s]<t or (s<n-1 and dp[s+1]<=t):
        print("Yes")
        return 
    else:
        print("No")
    
syakutori()
#print(dp)
for qi in range(qer):
    s,t=map(lambda x:int(x)-1,input().split())
    rx=nibtan_sr(s,t)
    ly=nibtan_sl(s,t)
   
    if rx==t or ly==s:
        check(s,t)
        continue
    else:
        if rx==None or ly==None:
            print("No")
            continue
        if ly-1<=rx:
            print("Yes")
            continue
        print("No")
        continue

    

提出情報

ジャッジ結果