1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52 |
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'findSum' function below.
#
# The function is expected to return a LONG_INTEGER_ARRAY.
# The function accepts following parameters:
# 1. INTEGER_ARRAY numbers
# 2. 2D_INTEGER_ARRAY queries
#
def findSum(numbers, queries):
a = [0]
b = [0]
for x in numbers:
a.append(a[-1] + x)
b.append(b[-1] + (x == 0))
return [a[r] - a[l - 1] + x * (b[r] - b[l - 1]) for l, r, x in queries]
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
numbers_count = int(input().strip())
numbers = []
for _ in range(numbers_count):
numbers_item = int(input().strip())
numbers.append(numbers_item)
queries_rows = int(input().strip())
queries_columns = int(input().strip())
queries = []
for _ in range(queries_rows):
queries.append(list(map(int, input().rstrip().split())))
result = findSum(numbers, queries)
fptr.write('\n'.join(map(str, result)))
fptr.write('\n')
fptr.close()
|
