結果
問題 | No.1199 お菓子配り-2 |
ユーザー | cozy_sauna |
提出日時 | 2021-10-10 20:55:19 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 335 ms / 1,000 ms |
コード長 | 1,924 bytes |
コンパイル時間 | 425 ms |
コンパイル使用メモリ | 11,256 KB |
実行使用メモリ | 50,028 KB |
最終ジャッジ日時 | 2023-10-12 18:11:11 |
合計ジャッジ時間 | 19,552 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 25 ms
9,648 KB |
testcase_01 | AC | 25 ms
9,492 KB |
testcase_02 | AC | 25 ms
9,520 KB |
testcase_03 | AC | 100 ms
19,408 KB |
testcase_04 | AC | 217 ms
35,212 KB |
testcase_05 | AC | 30 ms
10,456 KB |
testcase_06 | AC | 35 ms
10,948 KB |
testcase_07 | AC | 115 ms
21,776 KB |
testcase_08 | AC | 149 ms
26,332 KB |
testcase_09 | AC | 99 ms
19,624 KB |
testcase_10 | AC | 43 ms
12,028 KB |
testcase_11 | AC | 82 ms
17,284 KB |
testcase_12 | AC | 80 ms
16,996 KB |
testcase_13 | AC | 44 ms
12,152 KB |
testcase_14 | AC | 41 ms
11,788 KB |
testcase_15 | AC | 39 ms
11,292 KB |
testcase_16 | AC | 143 ms
25,720 KB |
testcase_17 | AC | 84 ms
17,376 KB |
testcase_18 | AC | 157 ms
27,300 KB |
testcase_19 | AC | 60 ms
13,924 KB |
testcase_20 | AC | 251 ms
40,272 KB |
testcase_21 | AC | 172 ms
28,656 KB |
testcase_22 | AC | 103 ms
19,332 KB |
testcase_23 | AC | 136 ms
23,444 KB |
testcase_24 | AC | 176 ms
29,488 KB |
testcase_25 | AC | 47 ms
12,424 KB |
testcase_26 | AC | 187 ms
31,284 KB |
testcase_27 | AC | 157 ms
27,016 KB |
testcase_28 | AC | 327 ms
49,788 KB |
testcase_29 | AC | 335 ms
49,616 KB |
testcase_30 | AC | 323 ms
49,784 KB |
testcase_31 | AC | 323 ms
50,020 KB |
testcase_32 | AC | 322 ms
49,880 KB |
testcase_33 | AC | 323 ms
49,860 KB |
testcase_34 | AC | 322 ms
49,636 KB |
testcase_35 | AC | 321 ms
49,600 KB |
testcase_36 | AC | 323 ms
49,796 KB |
testcase_37 | AC | 323 ms
49,920 KB |
testcase_38 | AC | 320 ms
49,700 KB |
testcase_39 | AC | 320 ms
50,028 KB |
testcase_40 | AC | 322 ms
49,776 KB |
testcase_41 | AC | 322 ms
49,864 KB |
testcase_42 | AC | 323 ms
49,960 KB |
testcase_43 | AC | 325 ms
49,776 KB |
testcase_44 | AC | 322 ms
49,664 KB |
testcase_45 | AC | 322 ms
49,664 KB |
testcase_46 | AC | 324 ms
49,884 KB |
testcase_47 | AC | 324 ms
49,812 KB |
ソースコード
from sys import setrecursionlimit, stdin from collections import defaultdict, deque from itertools import permutations, combinations, product from functools import lru_cache from random import sample, choice, randint, random from heapq import heappush, heappop from math import factorial, gcd, exp from copy import copy, deepcopy from time import time setrecursionlimit(500000) readline = stdin.readline # @lru_cache(maxsize=None) INF = 10 ** 18 MOD = 1000000007 MOD2 = 998244353 DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)] def I(): return int(readline()) def S(): return readline()[:-1] def LI(): return list(map(int, readline().split())) def SPI(): return map(int, readline().split()) def SPII(): return map(lambda x: int(x)-1, readline().split()) def FIE(x): return [readline()[:-1] for _ in [0] * x] def NODE(x): return [[] for _ in [0] * x] def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])] def nynx(y, x, ly = INF, lx = INF): return [(y+dy, x+dx) for dy, dx in DYDX if 0 <= y+dy < ly and 0 <= x+dx < lx] def imax(A, idx=-1, m=-(1<<18)): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m < a] return idx def imin(A, idx=-1, m=1<<18): for i, a in enumerate(A): m, idx = [[m, idx], [a, i]][m > a] return idx def cmin(dp, i, x): if x < dp[i]: dp[i] = x def cmax(dp, i, x): if x > dp[i]: dp[i] = x def gen(x, *args): ret = [x] * args[-1] for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e] return ret def puts(E): for e in E: print(e) def pprint(E): print() puts(E) #################################################################### N, M = SPI() A = [LI() for _ in range(N)] dp = gen(-INF, N+1, 2) dp[0][0] = 0 for i, a in enumerate(A): s = sum(A[i]) # not take dp[i+1][0] = dp[i][0] dp[i+1][1] = dp[i][1] # take cmax(dp[i+1], 1, dp[i][0]+s) cmax(dp[i+1], 0, dp[i][1]-s) print(max(dp[N]))