結果
問題 | No.2509 Beam Shateki |
ユーザー | mkawa2 |
提出日時 | 2023-10-20 21:47:00 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,915 bytes |
コンパイル時間 | 1,690 ms |
コンパイル使用メモリ | 81,372 KB |
実行使用メモリ | 83,220 KB |
最終ジャッジ日時 | 2023-10-20 21:48:33 |
合計ジャッジ時間 | 26,804 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
61,324 KB |
testcase_01 | AC | 42 ms
58,540 KB |
testcase_02 | AC | 41 ms
53,332 KB |
testcase_03 | AC | 670 ms
81,336 KB |
testcase_04 | AC | 700 ms
81,340 KB |
testcase_05 | AC | 676 ms
81,636 KB |
testcase_06 | AC | 663 ms
81,652 KB |
testcase_07 | AC | 685 ms
81,188 KB |
testcase_08 | AC | 662 ms
81,648 KB |
testcase_09 | AC | 692 ms
81,704 KB |
testcase_10 | AC | 677 ms
81,648 KB |
testcase_11 | AC | 723 ms
81,652 KB |
testcase_12 | AC | 727 ms
81,652 KB |
testcase_13 | TLE | - |
testcase_14 | TLE | - |
testcase_15 | TLE | - |
testcase_16 | TLE | - |
testcase_17 | TLE | - |
testcase_18 | TLE | - |
testcase_19 | TLE | - |
testcase_20 | TLE | - |
testcase_21 | TLE | - |
testcase_22 | TLE | - |
testcase_23 | TLE | - |
testcase_24 | TLE | - |
testcase_25 | TLE | - |
testcase_26 | TLE | - |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | TLE | - |
testcase_30 | TLE | - |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | AC | 381 ms
79,408 KB |
testcase_34 | AC | 902 ms
81,164 KB |
testcase_35 | AC | 1,596 ms
81,072 KB |
testcase_36 | AC | 589 ms
81,084 KB |
testcase_37 | AC | 179 ms
77,000 KB |
testcase_38 | AC | 615 ms
82,040 KB |
testcase_39 | AC | 562 ms
81,252 KB |
testcase_40 | AC | 1,023 ms
80,660 KB |
testcase_41 | AC | 146 ms
76,960 KB |
testcase_42 | AC | 692 ms
80,556 KB |
testcase_43 | AC | 1,760 ms
83,220 KB |
testcase_44 | AC | 1,987 ms
81,260 KB |
testcase_45 | AC | 544 ms
80,476 KB |
testcase_46 | AC | 774 ms
81,088 KB |
testcase_47 | TLE | - |
testcase_48 | AC | 788 ms
81,156 KB |
testcase_49 | AC | 1,143 ms
81,652 KB |
testcase_50 | AC | 1,290 ms
81,808 KB |
testcase_51 | AC | 321 ms
79,912 KB |
testcase_52 | AC | 980 ms
81,164 KB |
testcase_53 | AC | 51 ms
63,376 KB |
testcase_54 | AC | 53 ms
63,376 KB |
testcase_55 | AC | 59 ms
65,732 KB |
testcase_56 | AC | 58 ms
65,732 KB |
testcase_57 | AC | 62 ms
65,732 KB |
testcase_58 | AC | 57 ms
65,732 KB |
testcase_59 | AC | 57 ms
65,732 KB |
testcase_60 | AC | 59 ms
65,732 KB |
testcase_61 | AC | 58 ms
65,732 KB |
testcase_62 | AC | 57 ms
65,732 KB |
testcase_63 | AC | 58 ms
65,732 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = 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+7 md = 998244353 memo = {} def line(si, sj, di, dj): if (si, sj, di, dj) in memo: return memo[si, sj, di, dj] res = 0 i, j = si, sj while 0 <= i < h and 0 <= j < w: res += aa[i][j] i, j = i+di, j+dj memo[si, sj, di, dj] = res return res def cross(i, j, di, dj, p, q, dp, dq): st = set() while 0 <= i < h and 0 <= j < w: st.add((i, j)) i, j = i+di, j+dj i, j = p, q di, dj = dp, dq while 0 <= i < h and 0 <= j < w: if (i, j) in st: return i, j i, j = i+di, j+dj return -1, -1 def start(): for i in range(h): yield i, 0, 0, 1 yield i, 0, -1, 1 yield i, 0, 1, 1 for j in range(w): yield 0, j, 1, 0 yield 0, j, 1, 1 yield h-1, j, -1, 1 h, w = LI() aa = LLI(h) ans = 0 for i, j,di,dj in start(): for p, q,dp,dq in start(): if (i, j, di, dj) == (p, q, dp, dq): continue cur = 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)