結果
問題 | No.716 距離 |
ユーザー | McGregorsh |
提出日時 | 2023-04-05 16:51:29 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 135 ms / 2,000 ms |
コード長 | 1,514 bytes |
コンパイル時間 | 139 ms |
コンパイル使用メモリ | 82,548 KB |
実行使用メモリ | 89,856 KB |
最終ジャッジ日時 | 2024-04-10 01:05:40 |
合計ジャッジ時間 | 6,818 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 133 ms
89,856 KB |
testcase_01 | AC | 131 ms
89,320 KB |
testcase_02 | AC | 134 ms
89,644 KB |
testcase_03 | AC | 128 ms
89,576 KB |
testcase_04 | AC | 130 ms
89,772 KB |
testcase_05 | AC | 131 ms
89,612 KB |
testcase_06 | AC | 127 ms
89,548 KB |
testcase_07 | AC | 128 ms
89,572 KB |
testcase_08 | AC | 130 ms
89,652 KB |
testcase_09 | AC | 128 ms
89,712 KB |
testcase_10 | AC | 132 ms
89,352 KB |
testcase_11 | AC | 128 ms
89,672 KB |
testcase_12 | AC | 132 ms
89,564 KB |
testcase_13 | AC | 129 ms
89,204 KB |
testcase_14 | AC | 130 ms
89,632 KB |
testcase_15 | AC | 129 ms
89,528 KB |
testcase_16 | AC | 131 ms
89,560 KB |
testcase_17 | AC | 127 ms
89,588 KB |
testcase_18 | AC | 129 ms
89,552 KB |
testcase_19 | AC | 126 ms
89,608 KB |
testcase_20 | AC | 130 ms
89,616 KB |
testcase_21 | AC | 125 ms
89,760 KB |
testcase_22 | AC | 127 ms
89,780 KB |
testcase_23 | AC | 126 ms
89,636 KB |
testcase_24 | AC | 129 ms
89,560 KB |
testcase_25 | AC | 127 ms
89,616 KB |
testcase_26 | AC | 127 ms
89,652 KB |
testcase_27 | AC | 135 ms
89,632 KB |
testcase_28 | AC | 132 ms
89,560 KB |
testcase_29 | AC | 134 ms
89,684 KB |
testcase_30 | AC | 132 ms
89,608 KB |
testcase_31 | AC | 133 ms
89,612 KB |
testcase_32 | AC | 135 ms
89,560 KB |
testcase_33 | AC | 125 ms
89,572 KB |
testcase_34 | AC | 126 ms
89,576 KB |
testcase_35 | AC | 126 ms
89,624 KB |
testcase_36 | AC | 133 ms
89,644 KB |
testcase_37 | AC | 128 ms
89,536 KB |
testcase_38 | AC | 127 ms
89,348 KB |
testcase_39 | AC | 131 ms
89,572 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() ans = INF for i in range(N-1): a = A[i+1] - A[i] ans = min(ans, a) print(ans) print(A[-1] - A[0]) if __name__ == '__main__': main()