結果
問題 | No.406 鴨等間隔の法則 |
ユーザー | McGregorsh |
提出日時 | 2023-03-15 10:18:15 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 202 ms / 2,000 ms |
コード長 | 1,633 bytes |
コンパイル時間 | 194 ms |
コンパイル使用メモリ | 81,424 KB |
実行使用メモリ | 117,164 KB |
最終ジャッジ日時 | 2023-10-18 12:15:36 |
合計ジャッジ時間 | 8,277 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 174 ms
97,676 KB |
testcase_01 | AC | 151 ms
88,172 KB |
testcase_02 | AC | 150 ms
88,172 KB |
testcase_03 | AC | 151 ms
88,168 KB |
testcase_04 | AC | 198 ms
113,592 KB |
testcase_05 | AC | 166 ms
94,916 KB |
testcase_06 | AC | 167 ms
95,096 KB |
testcase_07 | AC | 163 ms
96,272 KB |
testcase_08 | AC | 192 ms
113,544 KB |
testcase_09 | AC | 202 ms
116,940 KB |
testcase_10 | AC | 164 ms
97,668 KB |
testcase_11 | AC | 187 ms
110,356 KB |
testcase_12 | AC | 171 ms
100,548 KB |
testcase_13 | AC | 171 ms
100,352 KB |
testcase_14 | AC | 197 ms
113,404 KB |
testcase_15 | AC | 150 ms
88,668 KB |
testcase_16 | AC | 151 ms
88,672 KB |
testcase_17 | AC | 150 ms
88,672 KB |
testcase_18 | AC | 150 ms
88,672 KB |
testcase_19 | AC | 153 ms
88,676 KB |
testcase_20 | AC | 156 ms
88,680 KB |
testcase_21 | AC | 155 ms
88,672 KB |
testcase_22 | AC | 157 ms
90,756 KB |
testcase_23 | AC | 174 ms
102,440 KB |
testcase_24 | AC | 189 ms
110,168 KB |
testcase_25 | AC | 202 ms
117,004 KB |
testcase_26 | AC | 198 ms
117,036 KB |
testcase_27 | AC | 169 ms
102,224 KB |
testcase_28 | AC | 184 ms
117,164 KB |
testcase_29 | AC | 199 ms
117,040 KB |
testcase_30 | AC | 200 ms
116,956 KB |
testcase_31 | AC | 199 ms
116,788 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, ROUND_HALF_UP 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() A.sort() AA = len(set(A)) if AA != N: print('NO') exit() nums = set() for i in range(N-1): a = A[i] b = A[i+1] nums.add(b-a) if len(nums) == 1: print('YES') else: print('NO') if __name__ == '__main__': main()