Leetcode heroes

завтрашний дейлик https://leetcode.com/problems/find-the-safest-path-in-a-grid class Solution: def maximumSafenessFactor(self, g: List[List[int]]) -> int: n=len(g);r=range(n);w=set(product(r,r));e=lambda x,y:{(x-1,y),(x,y-1),(x+1,y),(x,y+1)}&w;q=[(0,i,j)for i,j in w if g[i][j]];v=[[x-1 for x in k]for k in g];[setitem(v[i],j,s+1)or q.append((s+1,i,j))for s,x,y in q for i,j in e(x,y)if v[i][j]<0];h=[(-v[-1][-1],n-1,n-1)];p=heappop;f=lambda s,x,y:min(-s,v[0][0])if x|y==0 else[[heappush(h,(max(s,-v[i][j]),i,j))or w.discard((i,j))for i,j in e(x,y)]]and h and f(*p(h));return f(*p(h))if h else-1