1994C - Hungry Games - CodeForces Solution

import bisect

for _ in range(int(input())):
    n, x = map(int, input().split())
    a = list(map(int, input().split()))
    p = [0] * (n + 1)
    d = [0] * (n + 3)
    
    for i in range(n):
        p[i + 1] = p[i] + a[i]
    
    res = 0
    for i in range(n - 1, -1, -1):
        v = p[i] + x
        idx = bisect.bisect_left(p, v)
        
        if idx > n:
            d[i] += (n - i)
        elif v == p[idx]:
            d[i] += (idx - i) + (d[idx + 1] if idx + 1 < n + 3 else 0)
        else:
            d[i] += (idx - i - 1) + (d[idx] if idx < n + 3 else 0)
    
    res = sum(d[:n])
    print(res)