Submission #3042630

---

Source Code Expand

import bisect
n,m,Q = map(int,input().split())

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

question = []
for i in range(Q):
    p,q = map(int,input().split())
    question.append([p,q])
    table.append([p,q,1])

table.sort(key = lambda x: (x[1],x[2]))
cum = [0 for i in range(n+1)]


answer = dict()
for i in range(m+Q):
    if table[i][2] == 0:
        cum[table[i][0]] += 1
    else:
        ans = 0
        for k in range(table[i][0],table[i][1]+1):
            ans += cum[k]
        num = table[i][0]*10 + table[i][1]
        answer[num] = ans

for i in range(Q):
    ind = question[i][0]*10 + question[i][1]
    print(answer[ind])

Submission Info

Judge Result