結果

問題 No.1470 Mex Sum
ユーザー McGregorshMcGregorsh
提出日時 2022-07-19 14:14:53
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 180 ms / 2,000 ms
コード長 1,678 bytes
コンパイル時間 601 ms
コンパイル使用メモリ 82,328 KB
実行使用メモリ 118,000 KB
最終ジャッジ日時 2024-07-01 16:27:17
合計ジャッジ時間 11,797 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 142 ms
89,284 KB
testcase_01 AC 140 ms
89,404 KB
testcase_02 AC 145 ms
89,948 KB
testcase_03 AC 145 ms
90,096 KB
testcase_04 AC 145 ms
89,540 KB
testcase_05 AC 143 ms
89,632 KB
testcase_06 AC 145 ms
89,780 KB
testcase_07 AC 144 ms
89,764 KB
testcase_08 AC 146 ms
89,824 KB
testcase_09 AC 150 ms
89,432 KB
testcase_10 AC 146 ms
89,952 KB
testcase_11 AC 146 ms
89,952 KB
testcase_12 AC 180 ms
117,884 KB
testcase_13 AC 176 ms
117,688 KB
testcase_14 AC 178 ms
117,424 KB
testcase_15 AC 176 ms
116,976 KB
testcase_16 AC 175 ms
117,028 KB
testcase_17 AC 176 ms
117,388 KB
testcase_18 AC 178 ms
116,892 KB
testcase_19 AC 176 ms
117,396 KB
testcase_20 AC 179 ms
117,764 KB
testcase_21 AC 177 ms
117,824 KB
testcase_22 AC 179 ms
117,076 KB
testcase_23 AC 177 ms
117,836 KB
testcase_24 AC 177 ms
117,792 KB
testcase_25 AC 176 ms
117,132 KB
testcase_26 AC 180 ms
117,660 KB
testcase_27 AC 178 ms
117,696 KB
testcase_28 AC 176 ms
117,448 KB
testcase_29 AC 176 ms
117,744 KB
testcase_30 AC 177 ms
117,792 KB
testcase_31 AC 176 ms
117,408 KB
testcase_32 AC 179 ms
117,388 KB
testcase_33 AC 178 ms
117,884 KB
testcase_34 AC 178 ms
118,000 KB
testcase_35 AC 176 ms
117,360 KB
testcase_36 AC 179 ms
117,396 KB
testcase_37 AC 169 ms
116,232 KB
testcase_38 AC 172 ms
116,368 KB
testcase_39 AC 168 ms
116,584 KB
testcase_40 AC 176 ms
116,504 KB
testcase_41 AC 173 ms
116,596 KB
testcase_42 AC 171 ms
116,184 KB
testcase_43 AC 174 ms
115,988 KB
testcase_44 AC 170 ms
116,192 KB
testcase_45 AC 175 ms
116,448 KB
testcase_46 AC 172 ms
116,376 KB
testcase_47 AC 169 ms
116,700 KB
testcase_48 AC 169 ms
116,068 KB
testcase_49 AC 173 ms
116,260 KB
testcase_50 AC 173 ms
116,140 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

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()


0