結果
問題 | No.2203 POWER!!!!! |
ユーザー | McGregorsh |
提出日時 | 2023-03-17 22:11:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 224 ms / 2,000 ms |
コード長 | 1,558 bytes |
コンパイル時間 | 183 ms |
コンパイル使用メモリ | 81,496 KB |
実行使用メモリ | 115,900 KB |
最終ジャッジ日時 | 2023-10-18 15:02:33 |
合計ジャッジ時間 | 4,949 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 150 ms
88,336 KB |
testcase_01 | AC | 150 ms
88,332 KB |
testcase_02 | AC | 150 ms
88,340 KB |
testcase_03 | AC | 151 ms
88,320 KB |
testcase_04 | AC | 149 ms
88,240 KB |
testcase_05 | AC | 148 ms
88,340 KB |
testcase_06 | AC | 149 ms
88,336 KB |
testcase_07 | AC | 150 ms
88,240 KB |
testcase_08 | AC | 164 ms
89,276 KB |
testcase_09 | AC | 185 ms
96,044 KB |
testcase_10 | AC | 203 ms
102,656 KB |
testcase_11 | AC | 224 ms
112,576 KB |
testcase_12 | AC | 162 ms
89,276 KB |
testcase_13 | AC | 191 ms
115,900 KB |
testcase_14 | AC | 192 ms
115,900 KB |
testcase_15 | AC | 192 ms
115,896 KB |
testcase_16 | AC | 192 ms
115,892 KB |
testcase_17 | AC | 191 ms
115,896 KB |
testcase_18 | AC | 148 ms
88,240 KB |
testcase_19 | AC | 149 ms
88,328 KB |
testcase_20 | AC | 147 ms
88,328 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, ROUND_HALF_UP 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() count = Counter(A) ans = 0 for i in range(N): for key, value in count.items(): score = A[i] ** key * value ans += score print(ans) if __name__ == '__main__': main()