Submission #6513106

---

Source Code Expand

n,d,k = map(int,input().split())
l_ls = [[int(x) for x in input().split()] for _ in range(d)]
s_ls = [[int(x) for x in input().split()] for _ in range(k)]

def solve(ls,start,end):
    now = start
    day = 0
    for i in range(d):
        can = ls[i]
        if can[0]<=now<=can[1]:

            if can[0]<=end<=can[1]:
                print(day+1)
                break
            if abs(now-end)>min(abs(end-can[0]),abs(end-can[1])):
                if abs(end-can[0])<=abs(end-can[1]):
                    now = can[0]
                else:
                    now = can[1]
        day +=1

for j in range(k):
    solve(l_ls,s_ls[j][0],s_ls[j][1])


        

Submission Info

Judge Result