Submission #69338090


Source Code Expand

N, Q = map(int, input().split())
A = [0]+list(map(int, input().split()))

P1 = [0] * (N + 1)
P2 = [0] * (N + 1)
P3 = [0] * (N + 1)
for i in range(1, N + 1):
    ai = A[i]
    P1[i] = P1[i-1] + ai
    P2[i] = P2[i-1] + i * ai
    P3[i] = P3[i-1] + i * i * ai

out_lines = []
for _ in range(Q):
    L, R = map(int, input().split())
    s1 = P1[R] - P1[L-1]
    s2 = P2[R] - P2[L-1]
    s3 = P3[R] - P3[L-1]
    ans = (R + L) * s2 - (R + 1) * (L - 1) * s1 - s3
    out_lines.append(str(ans))

print("\n".join(out_lines))

Submission Info

Submission Time
Task E - Sum of Subarrays
User uparupaaa
Language Python (PyPy 3.10-v7.3.12)
Score 475
Code Size 542 Byte
Status AC
Exec Time 254 ms
Memory 139532 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 475 / 475
Status
AC × 1
AC × 16
Set Name Test Cases
Sample sample00.txt
All sample00.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt
Case Name Status Exec Time Memory
sample00.txt AC 55 ms 76560 KiB
testcase00.txt AC 55 ms 76208 KiB
testcase01.txt AC 153 ms 96388 KiB
testcase02.txt AC 192 ms 112140 KiB
testcase03.txt AC 149 ms 101824 KiB
testcase04.txt AC 153 ms 114276 KiB
testcase05.txt AC 151 ms 128168 KiB
testcase06.txt AC 106 ms 90992 KiB
testcase07.txt AC 181 ms 109572 KiB
testcase08.txt AC 248 ms 138596 KiB
testcase09.txt AC 249 ms 138604 KiB
testcase10.txt AC 252 ms 138628 KiB
testcase11.txt AC 251 ms 138588 KiB
testcase12.txt AC 254 ms 138788 KiB
testcase13.txt AC 253 ms 138908 KiB
testcase14.txt AC 197 ms 139532 KiB