Submission #62292970

---

Source Code Expand

n,w=map(int,input().split())
xo=[list() for sfdf in range(w)]
for x in range(n):
    tmp=list(map(int,input().split()))
    tmp.append(x)
    xo[tmp[0]-1].append(tmp)
iiyo=list()
for y in xo:
    iiyo.append(sorted(y,key=lambda x:x[1]))
ans=[-1 for fdsdf in  range(n)]
ikuyo=0
sou=0
baibai=0
while True:
    if ikuyo==0:
        max=0
        for da in iiyo:
            try:
                if da[sou][1]>max:
                    max=da[sou][1]
            except:
                baibai=1
                break
        if baibai==1:
            break
        ikuyo=1
    if ikuyo==1:
        for dae in iiyo:
            ans[dae[sou][2]]=max
        ikuyo=0
        sou+=1
q=int(input())
que=[list(map(int,input().split())) for xadasd in range(q)]
for answer in que:
    if ans[answer[1]-1]==-1:
        print("Yes")
    elif ans[answer[1]-1]>answer[0]:
        print("Yes")
    else:
        print("No")

Submission Info

Judge Result