提出 #75672824

---

ソースコード 拡げる

import sys
input = sys.stdin.readline

def biup(x,L):
    lo,hi = 0,len(L)
    while lo < hi:
        m = (lo+hi)//2
        if L[m][:2] <= x: lo = m+1
        else: hi = m
    return lo

def bilo(x,L):
    lo,hi = 0,len(L)
    while lo < hi:
        m = (lo+hi)//2
        if L[m][:2] < x: lo = m+1
        else: hi = m
    return lo

n,m = map(int,input().split())
L = []
for i in range(m):
    l,r = map(int,input().split())
    L.append([l,r,i])

A,B = [],[]
for l,r,i in L:
    A.append([l,r,i])
    B.append([r,l,i])
A.sort(key = lambda x: (x[0],x[1]))
B.sort(key = lambda x: (x[0],x[1]))

q = int(input())
for _ in range(q):
    s,t = map(int,input().split())
    a = biup([s,t],A)
    b = bilo([t,s],B)
    C,D = [],[]
    
    for i in range(a-1,max(-1,a-3),-1):
        if A[i][0] == s: C.append(A[i])
    for i in range(b,min(len(B),b+2)):
        if B[i][0] == t: D.append([B[i][1],B[i][0],B[i][2]])
    
    f = False
    for a,b,i in C:
        for c,d,j in D:
            if i != j and b >= c-1:
                f = True
                break
        if f: break
    
    if f: print('Yes')
    else: print('No')

提出情報

ジャッジ結果