提出 #62303231

ソースコード 拡げる

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
N, W = map(int, input().split())
X, Y = [], []
B = [[] for _ in range(W)]
E = [10**9+10 for _ in range(N)]
for i in range(N):
    x, y = map(int, input().split())
    X.append(x-1)
    Y.append(y-1)
    B[x-1].append((y-1, i))
T, A = [], []
Q = int(input())
for _ in range(Q):
    t, a = map(int, input().split())
    T.append(t)
    A.append(a-1)
mT = 0
mB = min(map(len, B))
for i in range(mB):
    As = []
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N, W = map(int, input().split())
X, Y = [], []
B = [[] for _ in range(W)]
E = [10**9+10 for _ in range(N)]
for i in range(N):
    x, y = map(int, input().split())
    X.append(x-1)
    Y.append(y-1)
    B[x-1].append((y-1, i))

T, A = [], []
Q = int(input())
for _ in range(Q):
    t, a = map(int, input().split())
    T.append(t)
    A.append(a-1)

mT = 0
mB = min(map(len, B))
for i in range(mB):
    As = []
    my = 0
    for j in range(W):
        y, a = B[j][i]
        As.append(a)
        my = max(my, max(mT, y))
    for a in As:
        E[a] = my + 1
        mT = my

for q in range(Q):
    t, a = T[q], A[q]
    if E[a] <= t:
        print("No")
    else:
        print("Yes")

提出情報

ジャッジ結果