結果
問題 | No.1884 Sequence |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 21:07:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 335 ms / 2,000 ms |
コード長 | 2,051 bytes |
コンパイル時間 | 240 ms |
コンパイル使用メモリ | 82,080 KB |
実行使用メモリ | 172,380 KB |
最終ジャッジ日時 | 2024-07-17 10:18:26 |
合計ジャッジ時間 | 12,827 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
89,280 KB |
testcase_01 | AC | 141 ms
89,276 KB |
testcase_02 | AC | 141 ms
89,280 KB |
testcase_03 | AC | 142 ms
89,384 KB |
testcase_04 | AC | 140 ms
89,536 KB |
testcase_05 | AC | 145 ms
89,612 KB |
testcase_06 | AC | 145 ms
89,500 KB |
testcase_07 | AC | 145 ms
89,584 KB |
testcase_08 | AC | 143 ms
89,652 KB |
testcase_09 | AC | 144 ms
89,740 KB |
testcase_10 | AC | 330 ms
172,380 KB |
testcase_11 | AC | 335 ms
172,192 KB |
testcase_12 | AC | 166 ms
110,368 KB |
testcase_13 | AC | 171 ms
113,172 KB |
testcase_14 | AC | 176 ms
110,628 KB |
testcase_15 | AC | 229 ms
126,964 KB |
testcase_16 | AC | 302 ms
172,128 KB |
testcase_17 | AC | 200 ms
134,716 KB |
testcase_18 | AC | 213 ms
128,512 KB |
testcase_19 | AC | 217 ms
140,032 KB |
testcase_20 | AC | 235 ms
136,284 KB |
testcase_21 | AC | 210 ms
130,536 KB |
testcase_22 | AC | 238 ms
144,152 KB |
testcase_23 | AC | 300 ms
172,260 KB |
testcase_24 | AC | 301 ms
172,372 KB |
testcase_25 | AC | 282 ms
150,808 KB |
testcase_26 | AC | 296 ms
172,240 KB |
testcase_27 | AC | 174 ms
116,572 KB |
testcase_28 | AC | 176 ms
116,912 KB |
testcase_29 | AC | 174 ms
116,316 KB |
testcase_30 | AC | 174 ms
116,700 KB |
testcase_31 | AC | 196 ms
131,404 KB |
testcase_32 | AC | 234 ms
134,908 KB |
testcase_33 | AC | 206 ms
125,792 KB |
testcase_34 | AC | 204 ms
125,792 KB |
testcase_35 | AC | 179 ms
117,856 KB |
testcase_36 | AC | 200 ms
130,004 KB |
testcase_37 | AC | 206 ms
125,924 KB |
testcase_38 | AC | 204 ms
123,848 KB |
testcase_39 | AC | 185 ms
120,096 KB |
testcase_40 | AC | 188 ms
121,172 KB |
testcase_41 | AC | 260 ms
133,024 KB |
testcase_42 | AC | 256 ms
132,508 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() zero = 0 nums = [] for i in range(n): if A[i] != 0: nums.append(A[i]) else: zero += 1 uu = len(set(nums)) if uu == 1: print('Yes') exit() else: if uu != n - zero: print('No') exit() nums.sort() lines = [] for i in range(len(nums)-1): lines.append(nums[i+1] - nums[i]) score = 0 for i in range(len(lines)): point = gcd(score, lines[i]) score = point count = 0 for i in range(len(lines)): count += lines[i] // score - 1 if count <= zero: print('Yes') else: print('No') if __name__ == '__main__': main()