結果
問題 | No.561 東京と京都 |
ユーザー | McGregorsh |
提出日時 | 2022-06-28 13:38:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 119 ms / 2,000 ms |
コード長 | 1,559 bytes |
コンパイル時間 | 184 ms |
コンパイル使用メモリ | 82,368 KB |
実行使用メモリ | 83,856 KB |
最終ジャッジ日時 | 2024-05-01 04:41:13 |
合計ジャッジ時間 | 3,546 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 117 ms
83,856 KB |
testcase_01 | AC | 117 ms
83,596 KB |
testcase_02 | AC | 119 ms
83,164 KB |
testcase_03 | AC | 116 ms
83,604 KB |
testcase_04 | AC | 114 ms
83,192 KB |
testcase_05 | AC | 113 ms
83,728 KB |
testcase_06 | AC | 115 ms
83,840 KB |
testcase_07 | AC | 114 ms
83,564 KB |
testcase_08 | AC | 115 ms
83,592 KB |
testcase_09 | AC | 109 ms
83,568 KB |
testcase_10 | AC | 115 ms
83,356 KB |
testcase_11 | AC | 112 ms
83,616 KB |
testcase_12 | AC | 114 ms
83,692 KB |
testcase_13 | AC | 116 ms
83,300 KB |
testcase_14 | AC | 115 ms
83,720 KB |
testcase_15 | AC | 114 ms
83,768 KB |
testcase_16 | AC | 117 ms
83,604 KB |
testcase_17 | AC | 114 ms
83,428 KB |
testcase_18 | AC | 116 ms
83,564 KB |
testcase_19 | AC | 112 ms
83,620 KB |
testcase_20 | AC | 114 ms
83,576 KB |
ソースコード
import sys, re 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 sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): n, d = i_map() t = [] k = [] for i in range(n): a, b = i_map() t.append(a) k.append(b) tdp = [0] * (n+1) kdp = [0] * (n+1) tdp[1] = t[0] kdp[1] = k[0] - d for i in range(1, n): tdp[i+1] = max(tdp[i]+t[i], kdp[i] - d + t[i]) kdp[i+1] = max(kdp[i]+k[i], tdp[i] - d + k[i]) print(max(tdp[-1], kdp[-1])) if __name__ == '__main__': main()