Submission #6505988

---

Source Code Expand

import numpy as np
import sys
input = sys.stdin.readline

N,D,K = map(int,input().split())
LR = [[int(x) for x in input().split()] for _ in range(D)]
ST = [[int(x) for x in input().split()] for _ in range(K)]

S,T = map(np.array, zip(*ST))
# 各民族が最大でどの範囲まで移動できているか
SL = S.copy()
SR = S.copy()

INF = 10 ** 18
answer = np.full_like(S, INF)

for day,(left, right) in enumerate(LR,1):
  SL[(left <= SL) & (SL <= right)] = left
  SR[(left <= SR) & (SR <= right)] = right
  arrived = (SL <= T) & (T <= SR)
  answer[arrived] = np.minimum(answer[arrived], day)

print(*answer, sep='\n')

Submission Info

Judge Result