Submission #3235447


Source Code Expand

n,k = (int(i) for i in input().split())
a = [int(input())-k for i in range(n)]
b = [[0,0]]
for i in range(n): b.append([b[-1][0]+a[i],i+1])
b.sort()
num,c = 1,[[b[0][1],1]]
for i in range(1,n+1):
	if b[i][0]!=b[i-1][0]: num+=1
	c.append([b[i][1],num])
c,d,ans = sorted(c),[0]*(n+2),0
def add(i):
	while i<=n:
		d[i] += 1
		i += i & -i
def get(i):
	s = 0
	while i:
		s += d[i]
		i -= i & -i
	return s
for i,j in c:
	ans+=get(j)
	add(j)
print(ans)

Submission Info

Submission Time
Task E - Meaningful Mean
User Clamperl
Language Python (3.4.3)
Score 0
Code Size 468 Byte
Status WA
Exec Time 1961 ms
Memory 76104 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 600
Status
AC × 3
AC × 22
WA × 1
Set Name Test Cases
Sample a01, a02, a03
All a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23
Case Name Status Exec Time Memory
a01 AC 17 ms 3064 KB
a02 AC 17 ms 3064 KB
a03 AC 17 ms 3064 KB
b04 AC 17 ms 3064 KB
b05 AC 1461 ms 55068 KB
b06 AC 1453 ms 67736 KB
b07 AC 1528 ms 71996 KB
b08 AC 1530 ms 72112 KB
b09 AC 1596 ms 74808 KB
b10 AC 1544 ms 75248 KB
b11 AC 17 ms 3064 KB
b12 AC 23 ms 3316 KB
b13 AC 581 ms 29044 KB
b14 WA 1921 ms 75584 KB
b15 AC 1552 ms 65296 KB
b16 AC 1595 ms 75168 KB
b17 AC 1932 ms 75228 KB
b18 AC 1961 ms 75580 KB
b19 AC 1517 ms 76104 KB
b20 AC 1746 ms 68964 KB
b21 AC 1486 ms 62744 KB
b22 AC 1521 ms 75148 KB
b23 AC 1530 ms 75292 KB