結果
問題 | No.118 門松列(2) |
ユーザー | McGregorsh |
提出日時 | 2022-06-16 09:30:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 166 ms / 5,000 ms |
コード長 | 1,690 bytes |
コンパイル時間 | 232 ms |
コンパイル使用メモリ | 82,604 KB |
実行使用メモリ | 101,888 KB |
最終ジャッジ日時 | 2024-04-15 19:49:48 |
合計ジャッジ時間 | 5,367 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 142 ms
89,472 KB |
testcase_01 | AC | 160 ms
101,888 KB |
testcase_02 | AC | 161 ms
101,504 KB |
testcase_03 | AC | 159 ms
101,760 KB |
testcase_04 | AC | 163 ms
101,888 KB |
testcase_05 | AC | 166 ms
101,504 KB |
testcase_06 | AC | 127 ms
83,812 KB |
testcase_07 | AC | 128 ms
83,200 KB |
testcase_08 | AC | 128 ms
83,200 KB |
testcase_09 | AC | 161 ms
100,224 KB |
testcase_10 | AC | 150 ms
89,984 KB |
testcase_11 | AC | 147 ms
90,624 KB |
testcase_12 | AC | 140 ms
89,856 KB |
testcase_13 | AC | 144 ms
89,568 KB |
testcase_14 | AC | 160 ms
100,224 KB |
testcase_15 | AC | 144 ms
89,344 KB |
testcase_16 | AC | 151 ms
93,420 KB |
testcase_17 | AC | 142 ms
89,956 KB |
testcase_18 | AC | 148 ms
90,240 KB |
testcase_19 | AC | 148 ms
93,172 KB |
testcase_20 | AC | 149 ms
93,456 KB |
testcase_21 | AC | 154 ms
98,176 KB |
testcase_22 | AC | 142 ms
89,856 KB |
testcase_23 | AC | 149 ms
96,896 KB |
testcase_24 | AC | 145 ms
91,340 KB |
testcase_25 | AC | 144 ms
93,192 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n = int(input()) a = i_list() set_a = list(set(a)) set_a.sort() count_a = Counter(a) accumu_a = [0] * len(set_a) for i in range(len(set_a)): accumu_a[i] = count_a[set_a[i]] accumu_count_a = list(accumulate(accumu_a)) #print(set_a) #print(accumu_count_a) ans = 0 for i in range(1, len(set_a)-1): num1 = accumu_count_a[i-1] num2 = accumu_count_a[-1] - accumu_count_a[i] ans += num1 * num2 * accumu_a[i] ans %= MOD print(ans) if __name__ == '__main__': main()