結果

問題 No.1884 Sequence
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-28 14:17:23
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 188 ms / 2,000 ms
コード長 3,735 bytes
コンパイル時間 529 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 144,768 KB
最終ジャッジ日時 2024-04-24 20:34:56
合計ジャッジ時間 8,691 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
64,768 KB
testcase_01 AC 58 ms
64,896 KB
testcase_02 AC 59 ms
64,512 KB
testcase_03 AC 57 ms
64,640 KB
testcase_04 AC 59 ms
64,768 KB
testcase_05 AC 57 ms
64,896 KB
testcase_06 AC 59 ms
64,768 KB
testcase_07 AC 55 ms
64,768 KB
testcase_08 AC 57 ms
64,640 KB
testcase_09 AC 59 ms
64,640 KB
testcase_10 AC 185 ms
144,512 KB
testcase_11 AC 182 ms
144,768 KB
testcase_12 AC 93 ms
98,944 KB
testcase_13 AC 96 ms
97,012 KB
testcase_14 AC 101 ms
98,944 KB
testcase_15 AC 155 ms
125,056 KB
testcase_16 AC 180 ms
144,256 KB
testcase_17 AC 119 ms
110,848 KB
testcase_18 AC 141 ms
128,640 KB
testcase_19 AC 128 ms
114,176 KB
testcase_20 AC 142 ms
115,072 KB
testcase_21 AC 127 ms
107,776 KB
testcase_22 AC 151 ms
122,240 KB
testcase_23 AC 178 ms
144,128 KB
testcase_24 AC 179 ms
144,640 KB
testcase_25 AC 188 ms
144,000 KB
testcase_26 AC 183 ms
144,128 KB
testcase_27 AC 100 ms
99,456 KB
testcase_28 AC 101 ms
99,716 KB
testcase_29 AC 100 ms
99,828 KB
testcase_30 AC 100 ms
99,440 KB
testcase_31 AC 130 ms
110,464 KB
testcase_32 AC 175 ms
141,440 KB
testcase_33 AC 143 ms
141,056 KB
testcase_34 AC 153 ms
141,056 KB
testcase_35 AC 118 ms
100,268 KB
testcase_36 AC 138 ms
125,056 KB
testcase_37 AC 139 ms
141,312 KB
testcase_38 AC 140 ms
137,892 KB
testcase_39 AC 118 ms
105,856 KB
testcase_40 AC 121 ms
108,288 KB
testcase_41 AC 182 ms
140,548 KB
testcase_42 AC 180 ms
140,296 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)]
ALP = 26
''' 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, minus):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = map(int, input().split())
        node[a - minus].append(b - minus)
        node[b - minus].append(a - minus)
    return node 
def NODE_W(N, edge, minus):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = map(int, input().split())
        node[a - minus].append((b - minus, c))
        node[b - minus].append((a - minus, 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)

''' Alphabet '''
def id_a(s): return ord(s) - ord('a')
def id_A(s): return ord(s) - ord('A')
def st_a(i): return chr(ord('a') + i)
def st_A(i): return chr(ord('A') + i)

''' 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):
    if len(args) == 1: return [x] * args[0]
    if len(args) == 2: return [[x] * args[1] for _ in [0] * args[0]]
    if len(args) == 3: return [[[x] * args[2] for _ in [0] * args[1]] for _ in [0] * args[0]]
    if len(args) == 4: return [[[[x] * args[3] for _ in [0] * args[2]] for _ in [0] * args[1]] for _ in [0] * args[0]]
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 
def gcd(x, y):
    if x == 0: return y
    return gcd(y % x, x)
def lcm(a, b):
    return a // gcd(a,b) * b
def compress(A, indexed = 0): return {e : i + indexed for i, e in enumerate(sorted(set(A)))}

''' 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 YN(x): print("YES" if x else "NO")
def blank(arr): print(" ".join(map(str, arr)))
def link(arr): print(''.join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

N = I()
A = LI()
cnt = sum(a == 0 for a in A)
A = sorted([a for a in A if a > 0])
B = [aa - a for a, aa in zip(A, A[1:])]
if 0 in B: yn(all(e == A[0] for e in A))
else:
    if not B: print("Yes")
    else:
        g = B[0]
        for b in B[1:]: g = gcd(g, b)
        need = sum(b // g - 1 for b in B)
        yn(need <= cnt)
0