結果
問題 | No.1199 お菓子配り-2 |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 23:50:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 381 ms / 1,000 ms |
コード長 | 1,653 bytes |
コンパイル時間 | 401 ms |
コンパイル使用メモリ | 87,076 KB |
実行使用メモリ | 94,496 KB |
最終ジャッジ日時 | 2023-08-22 14:03:05 |
合計ジャッジ時間 | 25,777 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 278 ms
92,348 KB |
testcase_01 | AC | 245 ms
92,456 KB |
testcase_02 | AC | 243 ms
92,220 KB |
testcase_03 | AC | 314 ms
93,448 KB |
testcase_04 | AC | 335 ms
94,204 KB |
testcase_05 | AC | 250 ms
93,124 KB |
testcase_06 | AC | 256 ms
93,064 KB |
testcase_07 | AC | 293 ms
93,736 KB |
testcase_08 | AC | 303 ms
93,508 KB |
testcase_09 | AC | 283 ms
93,344 KB |
testcase_10 | AC | 260 ms
93,288 KB |
testcase_11 | AC | 271 ms
93,468 KB |
testcase_12 | AC | 273 ms
93,612 KB |
testcase_13 | AC | 259 ms
93,236 KB |
testcase_14 | AC | 259 ms
93,404 KB |
testcase_15 | AC | 262 ms
93,036 KB |
testcase_16 | AC | 309 ms
93,556 KB |
testcase_17 | AC | 280 ms
93,280 KB |
testcase_18 | AC | 310 ms
94,024 KB |
testcase_19 | AC | 270 ms
93,460 KB |
testcase_20 | AC | 344 ms
94,072 KB |
testcase_21 | AC | 316 ms
93,644 KB |
testcase_22 | AC | 292 ms
93,880 KB |
testcase_23 | AC | 308 ms
94,032 KB |
testcase_24 | AC | 319 ms
93,940 KB |
testcase_25 | AC | 261 ms
93,288 KB |
testcase_26 | AC | 318 ms
93,440 KB |
testcase_27 | AC | 301 ms
93,532 KB |
testcase_28 | AC | 381 ms
94,100 KB |
testcase_29 | AC | 371 ms
94,408 KB |
testcase_30 | AC | 371 ms
94,184 KB |
testcase_31 | AC | 373 ms
94,272 KB |
testcase_32 | AC | 376 ms
94,404 KB |
testcase_33 | AC | 377 ms
94,104 KB |
testcase_34 | AC | 375 ms
94,228 KB |
testcase_35 | AC | 372 ms
94,256 KB |
testcase_36 | AC | 377 ms
94,212 KB |
testcase_37 | AC | 376 ms
94,496 KB |
testcase_38 | AC | 373 ms
94,332 KB |
testcase_39 | AC | 368 ms
94,436 KB |
testcase_40 | AC | 371 ms
94,088 KB |
testcase_41 | AC | 371 ms
94,324 KB |
testcase_42 | AC | 373 ms
94,316 KB |
testcase_43 | AC | 377 ms
94,212 KB |
testcase_44 | AC | 374 ms
94,228 KB |
testcase_45 | AC | 378 ms
94,040 KB |
testcase_46 | AC | 380 ms
94,052 KB |
testcase_47 | AC | 378 ms
94,368 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, M = i_map() A = [] for i in range(N): a = i_list() A.append(sum(a)) dp = [[-INF] * 2 for i in range(N+1)] dp[0][0] = 0 for i in range(N): dp[i+1][0] = max(dp[i][1] - A[i], dp[i][0]) dp[i+1][1] = max(dp[i][0] + A[i], dp[i][1]) print(max(dp[-1])) if __name__ == '__main__': main()