結果
問題 | No.1077 Noelちゃんと星々4 |
ユーザー | McGregorsh |
提出日時 | 2023-07-12 21:40:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 392 ms / 2,000 ms |
コード長 | 1,673 bytes |
コンパイル時間 | 1,623 ms |
コンパイル使用メモリ | 86,992 KB |
実行使用メモリ | 93,472 KB |
最終ジャッジ日時 | 2023-10-12 11:41:40 |
合計ジャッジ時間 | 8,450 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
90,564 KB |
testcase_01 | AC | 245 ms
90,860 KB |
testcase_02 | AC | 349 ms
92,984 KB |
testcase_03 | AC | 377 ms
92,860 KB |
testcase_04 | AC | 291 ms
91,924 KB |
testcase_05 | AC | 276 ms
91,480 KB |
testcase_06 | AC | 299 ms
91,980 KB |
testcase_07 | AC | 320 ms
92,144 KB |
testcase_08 | AC | 289 ms
92,020 KB |
testcase_09 | AC | 286 ms
91,928 KB |
testcase_10 | AC | 380 ms
92,792 KB |
testcase_11 | AC | 334 ms
92,844 KB |
testcase_12 | AC | 320 ms
92,336 KB |
testcase_13 | AC | 279 ms
91,272 KB |
testcase_14 | AC | 376 ms
92,900 KB |
testcase_15 | AC | 317 ms
92,180 KB |
testcase_16 | AC | 293 ms
91,720 KB |
testcase_17 | AC | 322 ms
92,560 KB |
testcase_18 | AC | 375 ms
92,872 KB |
testcase_19 | AC | 279 ms
91,228 KB |
testcase_20 | AC | 243 ms
90,844 KB |
testcase_21 | AC | 392 ms
93,472 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()) Y = i_list() cost = [INF] * 10001 for i in range(10001): cost[i] = abs(Y[0] - i) for i in range(1, N): P = Y[i] ncost = [INF] * 10001 for j in range(10001): p = abs(P - j) if P >= j: ncost[j] = min(p + cost[j], ncost[j-1] - 1) else: ncost[j] = min(p + cost[j], ncost[j-1] + 1) cost = ncost #print(cost) print(min(cost)) if __name__ == '__main__': main()