結果
問題 | No.2509 Beam Shateki |
ユーザー | lloyz |
提出日時 | 2023-12-29 21:16:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 160 ms / 2,000 ms |
コード長 | 1,648 bytes |
コンパイル時間 | 239 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 77,496 KB |
最終ジャッジ日時 | 2023-12-29 21:17:07 |
合計ジャッジ時間 | 10,041 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
55,596 KB |
testcase_01 | AC | 44 ms
55,596 KB |
testcase_02 | AC | 42 ms
55,596 KB |
testcase_03 | AC | 125 ms
77,228 KB |
testcase_04 | AC | 122 ms
77,228 KB |
testcase_05 | AC | 122 ms
77,232 KB |
testcase_06 | AC | 122 ms
77,228 KB |
testcase_07 | AC | 123 ms
77,232 KB |
testcase_08 | AC | 123 ms
77,228 KB |
testcase_09 | AC | 122 ms
77,228 KB |
testcase_10 | AC | 123 ms
77,232 KB |
testcase_11 | AC | 124 ms
77,224 KB |
testcase_12 | AC | 121 ms
77,228 KB |
testcase_13 | AC | 135 ms
77,488 KB |
testcase_14 | AC | 135 ms
77,496 KB |
testcase_15 | AC | 137 ms
77,488 KB |
testcase_16 | AC | 136 ms
77,480 KB |
testcase_17 | AC | 137 ms
77,472 KB |
testcase_18 | AC | 138 ms
77,488 KB |
testcase_19 | AC | 137 ms
77,488 KB |
testcase_20 | AC | 138 ms
77,480 KB |
testcase_21 | AC | 137 ms
77,492 KB |
testcase_22 | AC | 138 ms
77,492 KB |
testcase_23 | AC | 135 ms
77,492 KB |
testcase_24 | AC | 136 ms
77,480 KB |
testcase_25 | AC | 135 ms
77,492 KB |
testcase_26 | AC | 136 ms
77,488 KB |
testcase_27 | AC | 139 ms
77,488 KB |
testcase_28 | AC | 137 ms
77,488 KB |
testcase_29 | AC | 136 ms
77,480 KB |
testcase_30 | AC | 136 ms
77,480 KB |
testcase_31 | AC | 138 ms
77,488 KB |
testcase_32 | AC | 136 ms
77,480 KB |
testcase_33 | AC | 73 ms
71,136 KB |
testcase_34 | AC | 126 ms
77,452 KB |
testcase_35 | AC | 160 ms
77,320 KB |
testcase_36 | AC | 111 ms
76,828 KB |
testcase_37 | AC | 79 ms
73,228 KB |
testcase_38 | AC | 112 ms
76,688 KB |
testcase_39 | AC | 110 ms
76,684 KB |
testcase_40 | AC | 122 ms
77,340 KB |
testcase_41 | AC | 49 ms
61,836 KB |
testcase_42 | AC | 109 ms
76,828 KB |
testcase_43 | AC | 136 ms
77,496 KB |
testcase_44 | AC | 131 ms
77,376 KB |
testcase_45 | AC | 110 ms
76,832 KB |
testcase_46 | AC | 114 ms
76,828 KB |
testcase_47 | AC | 130 ms
77,360 KB |
testcase_48 | AC | 122 ms
77,224 KB |
testcase_49 | AC | 123 ms
77,312 KB |
testcase_50 | AC | 125 ms
77,344 KB |
testcase_51 | AC | 76 ms
73,188 KB |
testcase_52 | AC | 127 ms
77,344 KB |
testcase_53 | AC | 42 ms
55,596 KB |
testcase_54 | AC | 43 ms
55,596 KB |
testcase_55 | AC | 54 ms
55,596 KB |
testcase_56 | AC | 42 ms
55,596 KB |
testcase_57 | AC | 43 ms
55,596 KB |
testcase_58 | AC | 43 ms
55,596 KB |
testcase_59 | AC | 43 ms
55,596 KB |
testcase_60 | AC | 42 ms
55,596 KB |
testcase_61 | AC | 42 ms
55,596 KB |
testcase_62 | AC | 42 ms
55,596 KB |
testcase_63 | AC | 42 ms
55,596 KB |
ソースコード
from collections import defaultdict h, w = map(int, input().split()) A = [list(map(int, input().split())) for _ in range(h)] T = defaultdict(int) Y = defaultdict(int) P = defaultdict(int) M = defaultdict(int) for i in range(h): for j in range(w): T[i] += A[i][j] Y[j] += A[i][j] P[i + j] += A[i][j] M[i - j] += A[i][j] ans = 0 L = [T, Y, P, M] for C in L: for i in C: for j in C: if i == j: continue ans = max(ans, C[i] + C[j]) for i in T: for j in Y: ans = max(ans, T[i] + Y[j] - A[i][j]) for i in T: for j in P: x = i y = j - i if 0 <= y < w: ans = max(ans, T[i] + P[j] - A[x][y]) else: ans = max(ans, T[i] + P[j]) for i in T: for j in M: x = i y = i - j if 0 <= y < w: ans = max(ans, T[i] + M[j] - A[x][y]) else: ans = max(ans, T[i] + M[j]) for i in Y: for j in P: x = j - i y = i if 0 <= x < h: ans = max(ans, Y[i] + P[j] - A[x][y]) else: ans = max(ans, Y[i] + P[j]) for i in Y: for j in M: x = i + j y = i if 0 <= x < h: ans = max(ans, Y[i] + M[j] - A[x][y]) else: ans = max(ans, Y[i] + M[j]) for i in P: for j in M: x = (i + j) / 2 y = (i - j) / 2 if int(x) == x and int(y) == y and 0 <= x < h and 0 <= y < w: x = int(x) y = int(y) ans = max(ans, P[i] + M[j] - A[x][y]) else: ans = max(ans, P[i] + M[j]) print(ans)