Envío 4986

Código

from collections import defaultdict
from bisect import bisect_right, bisect_left
    
_ = input()
nums = list(map(int, input().split(" ")))
snums = sorted(set(nums)) 
# try lists instead of maps, maybe it'll go faster
m = [[] for _ in range(len(snums))]
    
    
for i, n in enumerate(nums):
    bisect_left     
    m[bisect_left(snums, n)].append(i)
        
Q = int(input())
for _ in range(Q):
    L, R, X = map(int, input().split(" "))
    i = bisect_left(snums, X)    
    if i < len(snums) and snums[i] == X: 
        l = m[i]    
        print(bisect_right(l, R) - bisect_right(l, L - 1))
    else:     
        print(0)