Submission #22260892

---

Source Code Expand

import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
# from math import isqrt, prod,comb  # python3.8用(notpypy)
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

class tuplepacking:
    def __init__(self,maxsizelist):
        self.n=len(maxsizelist)
        self.maxsizelist=tuple(maxsizelist)
    
    def packing(self,*tuples):
        ans=0
        for size,tu in zip(self.maxsizelist,tuples):
            ans*=size
            ans+=tu
        return ans
    
    def unpacking(self,value):
        ans=[0]*self.n
        for i in range(self.n)[::-1]:
            value,ans[i]=divmod(value,self.maxsizelist[i])
        return ans

def main():
    r, c = map(int, input().split())
    A = [list(map(int, input().split())) for i in range(r)]
    B = [list(map(int, input().split())) for i in range(r-1)]

    mindist = [[10**10] * c for i in range(r)]
    fixed = [[False] * c for i in range(r)]
    hq = []
    #tp=tuplepacking([10**10,500,500])
    heappush(hq, (1, 0, 0))
    while hq:
        dist, x, y = heappop(hq)
        if x == r-1 and y == c-1:
            print(dist-1)
            return
        if fixed[x][y]:
            continue
        fixed[x][y] = True
        
        if y > 0 and not dist+A[x][y-1] >= mindist[x][y-1]:
            heappush(hq, (dist+A[x][y-1], x,y-1))
            mindist[x][y-1] = dist+A[x][y-1]
        if y < c-1 and not dist+A[x][y] >= mindist[x][y+1]:
            heappush(hq, (dist+A[x][y], x,y+1))
            mindist[x][y+1] = dist+A[x][y]
        if x < r-1 and not dist+B[x][y] >= mindist[x+1][y]:
            heappush(hq, (dist+B[x][y], x+1,y))
            mindist[x+1][y] = dist+B[x][y]
        for i in range(1,x+1):
            if dist+1+i >=mindist[x-i][y]:
                continue
            heappush(hq, (dist+1+i, x-i,y))
            mindist[x-i][y]=dist+1+i




    
        


if __name__ == '__main__':
    main()

Submission Info

Judge Result