結果
問題 | No.838 Noelちゃんと星々3 |
ユーザー | McGregorsh |
提出日時 | 2023-07-09 12:21:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 303 ms / 2,000 ms |
コード長 | 1,610 bytes |
コンパイル時間 | 261 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 114,088 KB |
最終ジャッジ日時 | 2023-09-30 15:20:57 |
合計ジャッジ時間 | 9,818 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 303 ms
114,032 KB |
testcase_01 | AC | 300 ms
113,952 KB |
testcase_02 | AC | 300 ms
114,004 KB |
testcase_03 | AC | 300 ms
114,088 KB |
testcase_04 | AC | 299 ms
113,984 KB |
testcase_05 | AC | 237 ms
90,108 KB |
testcase_06 | AC | 239 ms
90,144 KB |
testcase_07 | AC | 239 ms
90,092 KB |
testcase_08 | AC | 237 ms
90,216 KB |
testcase_09 | AC | 239 ms
89,940 KB |
testcase_10 | AC | 239 ms
90,136 KB |
testcase_11 | AC | 238 ms
89,856 KB |
testcase_12 | AC | 237 ms
89,948 KB |
testcase_13 | AC | 240 ms
90,060 KB |
testcase_14 | AC | 240 ms
89,868 KB |
testcase_15 | AC | 239 ms
89,916 KB |
testcase_16 | AC | 245 ms
90,048 KB |
testcase_17 | AC | 241 ms
90,028 KB |
testcase_18 | AC | 242 ms
89,872 KB |
testcase_19 | AC | 239 ms
90,084 KB |
testcase_20 | AC | 242 ms
89,876 KB |
testcase_21 | AC | 244 ms
90,140 KB |
testcase_22 | AC | 246 ms
90,024 KB |
testcase_23 | AC | 248 ms
90,216 KB |
testcase_24 | AC | 238 ms
89,916 KB |
testcase_25 | AC | 243 ms
90,164 KB |
testcase_26 | AC | 242 ms
89,840 KB |
testcase_27 | AC | 239 ms
89,936 KB |
testcase_28 | AC | 240 ms
89,968 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N = int(input()) X = i_list() X.sort() nums = [] for i in range(N-1): a, b = X[i], X[i+1] nums.append(b-a) dp = [[INF] * 2 for i in range(N)] dp[0][0] = 0 for i in range(N-1): score = nums[i] dp[i+1][0] = min(dp[i+1][0], dp[i][1]) dp[i+1][1] = min(dp[i+1][1], dp[i][0] + score, dp[i][1] + score) print(dp[-1][1]) if __name__ == '__main__': main()