結果
問題 | No.2509 Beam Shateki |
ユーザー |
![]() |
提出日時 | 2023-10-20 22:00:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,389 ms / 2,000 ms |
コード長 | 1,877 bytes |
コンパイル時間 | 933 ms |
コンパイル使用メモリ | 82,452 KB |
実行使用メモリ | 87,980 KB |
最終ジャッジ日時 | 2024-09-20 18:58:14 |
合計ジャッジ時間 | 47,025 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 61 |
ソースコード
import sys# sys.setrecursionlimit(200005)# sys.set_int_max_str_digits(200005)int1 = lambda x: int(x)-1pDB = lambda *x: print(*x, end="\n", file=sys.stderr)p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)def II(): return int(sys.stdin.readline())def LI(): return list(map(int, sys.stdin.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LI1(): return list(map(int1, sys.stdin.readline().split()))def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def SI(): return sys.stdin.readline().rstrip()dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = -1-(-1 << 31)# inf = -1-(-1 << 63)# md = 10**9+7md = 998244353memo = {}ijs = {}def line(si, sj, di, dj):if (si, sj, di, dj) in memo: return memo[si, sj, di, dj]res = 0i, j = si, sjst = set()while 0 <= i < h and 0 <= j < w:st.add((i, j))res += aa[i][j]i, j = i+di, j+djmemo[si, sj, di, dj] = resijs[si, sj, di, dj] = streturn resdef cross(i, j, di, dj, p, q, dp, dq):s=ijs[i, j, di, dj]t=ijs[p, q, dp, dq]if len(s)>len(t):s,t=t,sfor a in s:if a in t:return areturn -1,-1def start():for i in range(h):yield i, 0, 0, 1yield i, 0, -1, 1yield i, 0, 1, 1for j in range(w):yield 0, j, 1, 0yield 0, j, 1, 1yield h-1, j, -1, 1h, w = LI()aa = LLI(h)ans = 0for i, j, di, dj in start():for p, q, dp, dq in start():if (i, j, di, dj) == (p, q, dp, dq): continuecur = line(i, j, di, dj)+line(p, q, dp, dq)ci, cj = cross(i, j, di, dj, p, q, dp, dq)if ci != -1: cur -= aa[ci][cj]if cur > ans: ans = cur# print(ans, i, j, di, dj, p, q, dp, dq)print(ans)