結果

問題 No.1470 Mex Sum
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-09 15:54:14
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 183 ms / 2,000 ms
コード長 2,859 bytes
コンパイル時間 279 ms
コンパイル使用メモリ 86,736 KB
実行使用メモリ 108,976 KB
最終ジャッジ日時 2023-10-11 16:46:26
合計ジャッジ時間 12,834 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 148 ms
79,264 KB
testcase_01 AC 143 ms
79,348 KB
testcase_02 AC 149 ms
80,956 KB
testcase_03 AC 151 ms
81,240 KB
testcase_04 AC 151 ms
81,372 KB
testcase_05 AC 150 ms
80,936 KB
testcase_06 AC 150 ms
81,252 KB
testcase_07 AC 149 ms
81,196 KB
testcase_08 AC 149 ms
81,280 KB
testcase_09 AC 150 ms
81,388 KB
testcase_10 AC 151 ms
81,596 KB
testcase_11 AC 153 ms
81,300 KB
testcase_12 AC 183 ms
108,556 KB
testcase_13 AC 180 ms
108,632 KB
testcase_14 AC 181 ms
108,516 KB
testcase_15 AC 180 ms
108,576 KB
testcase_16 AC 180 ms
108,492 KB
testcase_17 AC 181 ms
108,544 KB
testcase_18 AC 178 ms
108,580 KB
testcase_19 AC 180 ms
108,592 KB
testcase_20 AC 178 ms
108,684 KB
testcase_21 AC 179 ms
108,908 KB
testcase_22 AC 183 ms
108,880 KB
testcase_23 AC 180 ms
108,828 KB
testcase_24 AC 180 ms
108,796 KB
testcase_25 AC 178 ms
108,664 KB
testcase_26 AC 182 ms
108,640 KB
testcase_27 AC 180 ms
108,740 KB
testcase_28 AC 182 ms
108,804 KB
testcase_29 AC 183 ms
108,888 KB
testcase_30 AC 180 ms
108,800 KB
testcase_31 AC 182 ms
108,608 KB
testcase_32 AC 179 ms
108,908 KB
testcase_33 AC 178 ms
108,716 KB
testcase_34 AC 180 ms
108,976 KB
testcase_35 AC 179 ms
108,896 KB
testcase_36 AC 183 ms
108,632 KB
testcase_37 AC 178 ms
108,148 KB
testcase_38 AC 177 ms
108,200 KB
testcase_39 AC 175 ms
108,108 KB
testcase_40 AC 177 ms
108,316 KB
testcase_41 AC 175 ms
108,200 KB
testcase_42 AC 174 ms
108,060 KB
testcase_43 AC 175 ms
108,296 KB
testcase_44 AC 175 ms
107,992 KB
testcase_45 AC 174 ms
108,108 KB
testcase_46 AC 176 ms
108,340 KB
testcase_47 AC 178 ms
107,992 KB
testcase_48 AC 175 ms
108,264 KB
testcase_49 AC 175 ms
108,152 KB
testcase_50 AC 176 ms
108,252 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x)-1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x)-1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = SPII()
        node[a].append(b)
        node[b].append(a)
    return node 

def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = SPI()
        a -= 1
        b -= 1
        node[a].append((b, c))
        node[b].append((a, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

def f(x): return x * (x - 1) // 2

N = I()
A = LI()
cnt = gen(0, 3)
for a in A:
    cnt[min(a - 1, 2)] += 1

ans = f(cnt[0]) * 2 + f(cnt[1]) + f(cnt[2]) + cnt[0] * cnt[1] * 3 + cnt[0] * cnt[2] * 2 + cnt[1] * cnt[2]
print(ans)
0