Example

Input

2 4
%.@\$
..\$\$


Output

Yes

Source: aizu | Difficulty: UNKNOWN_DIFFICULTY


Solutions:
import queue
di = [0, 1, 0, -1]
dj = [1, 0, -1, 0]
(h, w) = map(int, input().split())
field = [input() for i in range(h)]
pdist = [[1000] * w for i in range(h)]
sdist = [[1000] * w for i in range(h)]
pque = queue.Queue()
sque = queue.Queue()
for (i, row) in enumerate(field):
	for j in range(w):
		if row[j] is '@':
			pque.put((i, j))
			pdist[i][j] = 0
			pi = i
			pj = j
		if row[j] is '$':
			sque.put((i, j))
			sdist[i][j] = 0
		if row[j] is '%':
			gi = i
			gj = j
while not sque.empty():
	(i, j) = sque.get()
	for k in range(4):
		ni = i + di[k]
		nj = j + dj[k]
		if ni >= 0 and ni < h and (nj >= 0) and (nj < w):
			if field[ni][nj] is not '#' and sdist[ni][nj] > sdist[i][j] + 1:
				sdist[ni][nj] = sdist[i][j] + 1
				sque.put((ni, nj))
while not pque.empty():
	(i, j) = pque.get()
	for k in range(4):
		ni = i + di[k]
		nj = j + dj[k]
		if ni >= 0 and ni < h and (nj >= 0) and (nj < w):
			if field[ni][nj] is not '#' and pdist[ni][nj] > pdist[i][j] + 1 and (pdist[i][j] + 1 < sdist[ni][nj]):
				pdist[ni][nj] = pdist[i][j] + 1
				pque.put((ni, nj))
if pdist[gi][gj] < 1000:
	print('Yes')
else:
	print('No')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 998244353
dd = [(0, -1), (1, 0), (0, 1), (-1, 0)]
ddn = [(0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, -1), (-1, 0), (-1, 1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	(h, w) = LI()
	mp = [S() for _ in range(h)]

	def search(ss):
		d = collections.defaultdict(lambda : inf)
		q = []
		for s in ss:
			d[s] = 0
			heapq.heappush(q, (0, s))
		v = collections.defaultdict(bool)
		while len(q):
			(k, u) = heapq.heappop(q)
			if v[u]:
				continue
			v[u] = True
			for (di, dj) in dd:
				ni = u[0] + di
				nj = u[1] + dj
				if ni < 0 or ni >= h or nj < 0 or (nj >= w) or (mp[ni][nj] == '#'):
					continue
				uv = (ni, nj)
				if v[uv]:
					continue
				vd = k + 1
				if d[uv] > vd:
					d[uv] = vd
					heapq.heappush(q, (vd, uv))
		return d
	ss = []
	ps = None
	es = None
	for i in range(h):
		for j in range(w):
			if mp[i][j] == '$':
				ss.append((i, j))
			elif mp[i][j] == '@':
				ps = (i, j)
			elif mp[i][j] == '%':
				es = (i, j)
	pd = search(ss)
	d = search([ps])
	if d[es] < pd[es]:
		return 'Yes'
	return 'No'
print(main())