結果
問題 | No.1884 Sequence |
ユーザー | McGregorsh |
提出日時 | 2022-07-27 21:07:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 526 ms / 2,000 ms |
コード長 | 2,051 bytes |
コンパイル時間 | 435 ms |
コンパイル使用メモリ | 86,996 KB |
実行使用メモリ | 183,452 KB |
最終ジャッジ日時 | 2023-09-24 09:33:44 |
合計ジャッジ時間 | 19,444 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,336 KB |
testcase_01 | AC | 237 ms
92,428 KB |
testcase_02 | AC | 235 ms
92,316 KB |
testcase_03 | AC | 235 ms
92,396 KB |
testcase_04 | AC | 235 ms
92,396 KB |
testcase_05 | AC | 235 ms
92,516 KB |
testcase_06 | AC | 234 ms
92,488 KB |
testcase_07 | AC | 236 ms
92,328 KB |
testcase_08 | AC | 233 ms
92,424 KB |
testcase_09 | AC | 235 ms
92,368 KB |
testcase_10 | AC | 487 ms
182,884 KB |
testcase_11 | AC | 526 ms
183,452 KB |
testcase_12 | AC | 262 ms
114,520 KB |
testcase_13 | AC | 265 ms
117,440 KB |
testcase_14 | AC | 262 ms
114,672 KB |
testcase_15 | AC | 328 ms
143,996 KB |
testcase_16 | AC | 374 ms
183,000 KB |
testcase_17 | AC | 295 ms
130,852 KB |
testcase_18 | AC | 321 ms
149,548 KB |
testcase_19 | AC | 303 ms
136,288 KB |
testcase_20 | AC | 317 ms
136,516 KB |
testcase_21 | AC | 292 ms
122,588 KB |
testcase_22 | AC | 325 ms
139,508 KB |
testcase_23 | AC | 382 ms
183,092 KB |
testcase_24 | AC | 387 ms
183,304 KB |
testcase_25 | AC | 380 ms
182,536 KB |
testcase_26 | AC | 390 ms
182,840 KB |
testcase_27 | AC | 271 ms
121,084 KB |
testcase_28 | AC | 269 ms
120,752 KB |
testcase_29 | AC | 272 ms
120,780 KB |
testcase_30 | AC | 270 ms
120,984 KB |
testcase_31 | AC | 283 ms
117,720 KB |
testcase_32 | AC | 339 ms
166,740 KB |
testcase_33 | AC | 304 ms
136,448 KB |
testcase_34 | AC | 299 ms
136,360 KB |
testcase_35 | AC | 266 ms
121,312 KB |
testcase_36 | AC | 292 ms
127,544 KB |
testcase_37 | AC | 294 ms
136,176 KB |
testcase_38 | AC | 293 ms
135,084 KB |
testcase_39 | AC | 276 ms
122,436 KB |
testcase_40 | AC | 277 ms
122,712 KB |
testcase_41 | AC | 353 ms
165,292 KB |
testcase_42 | AC | 353 ms
165,044 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()