結果
問題 | No.1096 Range Sums |
ユーザー | McGregorsh |
提出日時 | 2022-07-09 13:15:09 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 286 ms / 2,000 ms |
コード長 | 1,623 bytes |
コンパイル時間 | 1,110 ms |
コンパイル使用メモリ | 86,912 KB |
実行使用メモリ | 125,956 KB |
最終ジャッジ日時 | 2023-08-29 00:32:08 |
合計ジャッジ時間 | 6,204 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
92,492 KB |
testcase_01 | AC | 243 ms
92,500 KB |
testcase_02 | AC | 237 ms
92,420 KB |
testcase_03 | AC | 239 ms
92,336 KB |
testcase_04 | AC | 238 ms
92,464 KB |
testcase_05 | AC | 239 ms
92,312 KB |
testcase_06 | AC | 237 ms
92,332 KB |
testcase_07 | AC | 239 ms
92,524 KB |
testcase_08 | AC | 235 ms
92,488 KB |
testcase_09 | AC | 233 ms
92,516 KB |
testcase_10 | AC | 278 ms
125,956 KB |
testcase_11 | AC | 281 ms
125,752 KB |
testcase_12 | AC | 286 ms
125,912 KB |
testcase_13 | AC | 284 ms
125,900 KB |
testcase_14 | AC | 280 ms
125,852 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): n = int(input()) A = i_list() accumu_a = list(accumulate(A)) accumu_a_new = list(accumulate(accumu_a)) ans = 0 sum_mae = 0 for i in range(n): ans += accumu_a_new[-1] - sum_mae sum_mae += A[i] * (n-i) print(ans) if __name__ == '__main__': main()