結果
問題 | No.1884 Sequence |
ユーザー | U S |
提出日時 | 2022-03-25 21:41:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 295 ms / 2,000 ms |
コード長 | 1,280 bytes |
コンパイル時間 | 278 ms |
コンパイル使用メモリ | 87,056 KB |
実行使用メモリ | 146,084 KB |
最終ジャッジ日時 | 2023-08-04 08:33:40 |
合計ジャッジ時間 | 10,539 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 124 ms
77,604 KB |
testcase_01 | AC | 124 ms
77,924 KB |
testcase_02 | AC | 124 ms
77,804 KB |
testcase_03 | AC | 125 ms
77,556 KB |
testcase_04 | AC | 125 ms
77,856 KB |
testcase_05 | AC | 123 ms
77,792 KB |
testcase_06 | AC | 125 ms
77,596 KB |
testcase_07 | AC | 123 ms
77,628 KB |
testcase_08 | AC | 122 ms
77,632 KB |
testcase_09 | AC | 127 ms
77,828 KB |
testcase_10 | AC | 295 ms
145,972 KB |
testcase_11 | AC | 275 ms
145,972 KB |
testcase_12 | AC | 157 ms
97,336 KB |
testcase_13 | AC | 160 ms
100,620 KB |
testcase_14 | AC | 162 ms
97,740 KB |
testcase_15 | AC | 207 ms
122,980 KB |
testcase_16 | AC | 243 ms
145,948 KB |
testcase_17 | AC | 180 ms
114,732 KB |
testcase_18 | AC | 202 ms
124,228 KB |
testcase_19 | AC | 183 ms
117,328 KB |
testcase_20 | AC | 197 ms
118,916 KB |
testcase_21 | AC | 187 ms
112,768 KB |
testcase_22 | AC | 206 ms
121,440 KB |
testcase_23 | AC | 241 ms
145,884 KB |
testcase_24 | AC | 243 ms
146,084 KB |
testcase_25 | AC | 245 ms
145,508 KB |
testcase_26 | AC | 248 ms
145,772 KB |
testcase_27 | AC | 162 ms
105,036 KB |
testcase_28 | AC | 163 ms
104,680 KB |
testcase_29 | AC | 168 ms
104,988 KB |
testcase_30 | AC | 168 ms
104,732 KB |
testcase_31 | AC | 195 ms
114,364 KB |
testcase_32 | AC | 237 ms
144,728 KB |
testcase_33 | AC | 204 ms
143,960 KB |
testcase_34 | AC | 201 ms
144,368 KB |
testcase_35 | AC | 169 ms
105,416 KB |
testcase_36 | AC | 194 ms
130,224 KB |
testcase_37 | AC | 206 ms
144,240 KB |
testcase_38 | AC | 201 ms
143,280 KB |
testcase_39 | AC | 180 ms
110,356 KB |
testcase_40 | AC | 181 ms
112,792 KB |
testcase_41 | AC | 229 ms
137,476 KB |
testcase_42 | AC | 229 ms
137,220 KB |
ソースコード
# import sys # input = sys.stdin.readline # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') def mp():return map(int,input().split()) def lmp():return list(map(int,input().split())) def mps(A):return [tuple(map(int, input().split())) for _ in range(A)] def stoi(LIST):return list(map(int,LIST)) def itos(LIST):return list(map(str,LIST)) def bitA(X,A):return X & 1<<A == 1<<A import math import bisect import heapq import time from copy import copy as cc from copy import deepcopy as dc from itertools import accumulate, product from collections import Counter, defaultdict, deque def ceil(U,V):return (U+V-1)//V def modf1(N,MOD):return (N-1)%MOD+1 inf = int(1e18+20) mod = 998244353 from functools import reduce def gcd(numbers): return reduce(math.gcd, numbers) n = int(input()) a = lmp() ra = [] cz = 0 for i in a: if i != 0:ra.append(i) else:cz += 1 if not ra: print("Yes") exit() ra.sort() dif = [] for i in range(len(ra)-1): dif.append(ra[i+1]-ra[i]) if 0 in dif: f = True for i in dif: if i != 0:f = False if f:print("Yes") else: print("No") exit() if not dif: print("Yes") exit() gd = gcd(dif) cnt = 0 for i in dif: cnt += i//gd - 1 if cnt <= cz: print("Yes") else: print("No")