結果
問題 | No.1470 Mex Sum |
ユーザー | McGregorsh |
提出日時 | 2022-07-19 14:14:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 293 ms / 2,000 ms |
コード長 | 1,678 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 86,824 KB |
実行使用メモリ | 122,140 KB |
最終ジャッジ日時 | 2023-09-14 09:06:40 |
合計ジャッジ時間 | 17,923 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 247 ms
92,308 KB |
testcase_01 | AC | 249 ms
92,620 KB |
testcase_02 | AC | 247 ms
93,248 KB |
testcase_03 | AC | 245 ms
93,456 KB |
testcase_04 | AC | 244 ms
93,660 KB |
testcase_05 | AC | 245 ms
93,292 KB |
testcase_06 | AC | 250 ms
93,868 KB |
testcase_07 | AC | 248 ms
93,600 KB |
testcase_08 | AC | 249 ms
94,072 KB |
testcase_09 | AC | 248 ms
93,752 KB |
testcase_10 | AC | 257 ms
93,752 KB |
testcase_11 | AC | 247 ms
93,248 KB |
testcase_12 | AC | 281 ms
121,928 KB |
testcase_13 | AC | 286 ms
121,616 KB |
testcase_14 | AC | 281 ms
121,568 KB |
testcase_15 | AC | 287 ms
121,624 KB |
testcase_16 | AC | 284 ms
121,624 KB |
testcase_17 | AC | 279 ms
121,496 KB |
testcase_18 | AC | 282 ms
121,320 KB |
testcase_19 | AC | 284 ms
121,588 KB |
testcase_20 | AC | 280 ms
121,824 KB |
testcase_21 | AC | 284 ms
121,700 KB |
testcase_22 | AC | 286 ms
122,068 KB |
testcase_23 | AC | 286 ms
121,760 KB |
testcase_24 | AC | 284 ms
121,680 KB |
testcase_25 | AC | 289 ms
121,736 KB |
testcase_26 | AC | 288 ms
121,740 KB |
testcase_27 | AC | 289 ms
121,528 KB |
testcase_28 | AC | 290 ms
121,612 KB |
testcase_29 | AC | 293 ms
121,796 KB |
testcase_30 | AC | 289 ms
121,716 KB |
testcase_31 | AC | 287 ms
121,684 KB |
testcase_32 | AC | 289 ms
121,680 KB |
testcase_33 | AC | 288 ms
121,684 KB |
testcase_34 | AC | 292 ms
121,740 KB |
testcase_35 | AC | 285 ms
121,716 KB |
testcase_36 | AC | 284 ms
122,140 KB |
testcase_37 | AC | 276 ms
120,948 KB |
testcase_38 | AC | 279 ms
120,796 KB |
testcase_39 | AC | 279 ms
120,792 KB |
testcase_40 | AC | 279 ms
120,840 KB |
testcase_41 | AC | 280 ms
120,888 KB |
testcase_42 | AC | 283 ms
120,888 KB |
testcase_43 | AC | 280 ms
121,068 KB |
testcase_44 | AC | 279 ms
120,872 KB |
testcase_45 | AC | 281 ms
120,924 KB |
testcase_46 | AC | 280 ms
120,980 KB |
testcase_47 | AC | 291 ms
120,796 KB |
testcase_48 | AC | 286 ms
120,872 KB |
testcase_49 | AC | 277 ms
121,016 KB |
testcase_50 | AC | 279 ms
120,876 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() one_cou = a.count(1) two_cou = a.count(2) another = n - one_cou - two_cou A = one_cou * (one_cou-1) B = one_cou * two_cou * 3 C = one_cou * another * 2 D = n * (n-1) // 2 - (A//2) - (B//3) - (C//2) #print(A, B, C, D) print(A + B + C + D) if __name__ == '__main__': main()