結果
問題 | No.3071 Double Speedrun |
ユーザー |
|
提出日時 | 2025-03-21 22:09:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 4,424 ms / 6,000 ms |
コード長 | 3,033 bytes |
コンパイル時間 | 430 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 268,928 KB |
最終ジャッジ日時 | 2025-03-21 22:09:41 |
合計ジャッジ時間 | 33,949 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 14 |
ソースコード
# input import sys # input = sys.stdin.readline II = lambda : int(input()) MI = lambda : map(int, input().split()) LI = lambda : [int(a) for a in input().split()] SI = lambda : input().rstrip() LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)] LSI = lambda n : [input().rstrip() for _ in range(n)] MI_1 = lambda : map(lambda x:int(x)-1, input().split()) LI_1 = lambda : [int(a)-1 for a in input().split()] def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]: edge = [set() for i in range(n+1+index)] for _ in range(m): a,b = map(int, input().split()) a += index b += index edge[a].add(b) if not dir: edge[b].add(a) return edge def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]: edge = [set() for i in range(n+1+index)] for _ in range(m): a,b,c = map(int, input().split()) a += index b += index edge[a].add((b,c)) if not dir: edge[b].add((a,c)) return edge mod = 998244353 inf = 1001001001001001001 ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97 ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97 yes = lambda : print("Yes") no = lambda : print("No") yn = lambda flag : print("Yes" if flag else "No") def acc(a:list[int]): sa = [0]*(len(a)+1) for i in range(len(a)): sa[i+1] = a[i] + sa[i] return sa prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1) alplow = "abcdefghijklmnopqrstuvwxyz" alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ" URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)} DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]] DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]] DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]] prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59] sys.set_int_max_str_digits(0) sys.setrecursionlimit(10**6) # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') from collections import defaultdict,deque from heapq import heappop,heappush from bisect import bisect_left,bisect_right DD = defaultdict BSL = bisect_left BSR = bisect_right h,w = MI() s = LSI(h) now = [[0]*h for i in range(h)] now[0][1] = 1 # ここから開始 for d in range(1, h + w - 3): nxt = [[0]*h for i in range(h)] for px in range(h): for qx in range(h): if now[px][qx] == 0: continue py = d - px qy = d - qx for i in range(2): for j in range(2): if px + i == qx + j: continue nx,ny = px+i, py+1-i mx,my = qx+j, qy+1-j if not (nx < h and ny < w and mx < h and my < w): continue if s[nx][ny] == "#" or s[mx][my] == "#": continue nxt[nx][mx] += now[px][qx] % mod now = nxt # print(now) ans = now[h-2][h-1] print(ans % mod)