結果
問題 | No.1638 Robot Maze |
ユーザー | kyaneko999 |
提出日時 | 2021-08-06 21:34:59 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 171 ms / 2,000 ms |
コード長 | 3,517 bytes |
コンパイル時間 | 195 ms |
コンパイル使用メモリ | 81,848 KB |
実行使用メモリ | 79,136 KB |
最終ジャッジ日時 | 2023-10-17 02:52:27 |
合計ジャッジ時間 | 6,711 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
65,956 KB |
testcase_01 | AC | 57 ms
65,956 KB |
testcase_02 | AC | 56 ms
65,956 KB |
testcase_03 | AC | 108 ms
77,996 KB |
testcase_04 | AC | 58 ms
65,956 KB |
testcase_05 | AC | 57 ms
65,956 KB |
testcase_06 | AC | 57 ms
65,956 KB |
testcase_07 | AC | 57 ms
65,956 KB |
testcase_08 | AC | 56 ms
65,956 KB |
testcase_09 | AC | 57 ms
65,956 KB |
testcase_10 | AC | 57 ms
65,956 KB |
testcase_11 | AC | 57 ms
65,956 KB |
testcase_12 | AC | 57 ms
65,956 KB |
testcase_13 | AC | 57 ms
65,956 KB |
testcase_14 | AC | 112 ms
77,936 KB |
testcase_15 | AC | 103 ms
77,916 KB |
testcase_16 | AC | 102 ms
77,920 KB |
testcase_17 | AC | 102 ms
77,916 KB |
testcase_18 | AC | 57 ms
65,956 KB |
testcase_19 | AC | 102 ms
77,928 KB |
testcase_20 | AC | 100 ms
77,924 KB |
testcase_21 | AC | 74 ms
73,236 KB |
testcase_22 | AC | 74 ms
73,172 KB |
testcase_23 | AC | 74 ms
73,172 KB |
testcase_24 | AC | 74 ms
73,236 KB |
testcase_25 | AC | 75 ms
73,236 KB |
testcase_26 | AC | 91 ms
77,524 KB |
testcase_27 | AC | 91 ms
77,528 KB |
testcase_28 | AC | 91 ms
77,528 KB |
testcase_29 | AC | 92 ms
77,528 KB |
testcase_30 | AC | 57 ms
65,956 KB |
testcase_31 | AC | 57 ms
65,956 KB |
testcase_32 | AC | 120 ms
78,148 KB |
testcase_33 | AC | 134 ms
78,636 KB |
testcase_34 | AC | 126 ms
78,248 KB |
testcase_35 | AC | 125 ms
77,944 KB |
testcase_36 | AC | 127 ms
77,924 KB |
testcase_37 | AC | 124 ms
78,180 KB |
testcase_38 | AC | 133 ms
78,696 KB |
testcase_39 | AC | 135 ms
78,796 KB |
testcase_40 | AC | 133 ms
78,404 KB |
testcase_41 | AC | 137 ms
78,788 KB |
testcase_42 | AC | 131 ms
78,060 KB |
testcase_43 | AC | 171 ms
79,136 KB |
testcase_44 | AC | 134 ms
78,052 KB |
testcase_45 | AC | 153 ms
78,704 KB |
testcase_46 | AC | 134 ms
78,208 KB |
testcase_47 | AC | 129 ms
77,772 KB |
testcase_48 | AC | 131 ms
77,864 KB |
testcase_49 | AC | 122 ms
77,964 KB |
testcase_50 | AC | 133 ms
78,560 KB |
testcase_51 | AC | 144 ms
78,816 KB |
ソースコード
from sys import exit, stdin, setrecursionlimit from collections import deque, defaultdict, Counter from copy import deepcopy from bisect import bisect_left, bisect_right, insort_left, insort_right from heapq import heapify, heappop, heappush from itertools import product, permutations, combinations, combinations_with_replacement from functools import reduce from math import gcd, sin, cos, tan, asin, acos, atan, atan2, degrees, radians, ceil, floor, sqrt, factorial from math import pi as PI from random import randint as rd setrecursionlimit(500000) INF = (1<<61)-1 EPS = 1e-10 MOD = 10**9+7 # MOD = 998244353 def input(): return stdin.readline().strip('\n') def intput(): return int(input()) def minput(): return input().split() def linput(): return input().split() def mint(): return map(int,input().split()) def lint(): return list(map(int,input().split())) def ilint(): return intput(),lint() def lcm(x,y): return x*y//gcd(x,y) def lgcd(l): return reduce(gcd,l) def llcm(l): return reduce(lcm,l) def powmod(n,i,mod=MOD): return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod) def div2(x): return x.bit_length() def div10(x): return len(str(x))-(x==0) def popcount(x): return bin(x).count('1') def digit(x,i,max_len=None): s = str(x) if max_len: i -= max_len-len(s) return int(s[i-1]) if i>0 else 0 def digitsum(x): ans = 0 for i in range(div10(x)): ans += digit(x,i+1) return ans def pf(x,mode='counter'): C = Counter() p = 2 while x>1: k = 0 while x%p==0: x //= p k += 1 if k>0: C[p] += k p = p+2-(p==2) if p*p<x else x if mode=='counter': return C S = set([1]) for k in C: T = set() for x in S: for i in range(C[k]+1): T.add(x*(k**i)) S = T if mode=='set': return S if mode=='list': return sorted(S) def isprime(x): if x<2: return False return len(pf(x,'set'))==2 def matmul(A, B): # import numpy A1, A2 = A >> 15, A & (1 << 15) - 1 B1, B2 = B >> 15, B & (1 << 15) - 1 X = np.dot(A1, B1) % MOD Y = np.dot(A2, B2) Z = np.dot(A1 + A2, B1 + B2) - X - Y return ((X << 30) + (Z << 15) + Y) % MOD def matpow(A, N): P = np.eye(A.shape[0], dtype=np.int64) while N: if N & 1: P = matmul(P, A) A = matmul(A, A) N >>= 1 return P def zash(S): lis = sorted(S) dic = {} for i,x in enumerate(lis): dic[x] = i return lis, dic def pr(*x): print(*x, sep='', end='') if len(x) else print() def lprint(l): for x in l: print(x) def ston(c, c0='a'): return ord(c)-ord(c0) def ntos(x, c0='a'): return chr(x+ord(c0)) def judge(x, l=['Yes', 'No']): print(l[0] if x else l[1]) def debug(*x, flag=1): if flag: print(*x) ###################################################### H,W=mint() U,D,R,L,K,P=mint() xs,ys,xt,yt=mint() C=[input() for _ in range(H)] d=[[INF]*W for _ in range(H)] d[xs-1][ys-1]=0 h=[[0,xs-1,ys-1]] delta=[[0,1,R],[0,-1,L],[1,0,D],[-1,0,U]] while h: c,i,j=heappop(h) if c>d[i][j]: continue for di,dj,cc in delta: x,y=i+di,j+dj if 0<=x<H and 0<=y<W and C[x][y]!='#': cost=d[i][j]+cc if C[x][y]=='@': cost+=P if d[x][y]>cost: d[x][y]=cost heappush(h,[cost,x,y]) judge(d[xt-1][yt-1]<=K)