648C - Путь Робота - CodeForces Solution


constructive algorithms dfs and similar graphs *1100

Please click on ads to support us..

Python Code:

n,m = map(int, input().split())

a = []
s_index = (0,0)
for i in range(n):
    row = list(input())
    try:
        s_index = (i, row.index('S'))
    except:
        pass
    a.append(row)

s = [s_index]
r = []
x,y = s_index

while(s):
    x,y = s.pop()
    if a[x][y]==0: continue
    if a[x][y]!='S':
        a[x][y] = 0

    for i,j, move in [(x-1, y, 'U'), (x, y+1, 'R'), (x+1, y, 'D'), (x, y-1, 'L')]:
        if i < n and j < m and i >= 0 and j >= 0 and (a[i][j]=='*'):
            s.append((i,j))
            r.append(move)
            break

for i,j, move in [(x-1, y, 'U'), (x, y+1, 'R'), (x+1, y, 'D'), (x, y-1, 'L')]:
    if i < n and j < m and i >= 0 and j >= 0 and (a[i][j]=='S'):
        r.append(move)
        break


print(*r, sep="")


Comments

Submit
0 Comments
More Questions

1335A - Candies and Two Sisters
96B - Lucky Numbers (easy)
1151B - Dima and a Bad XOR
1435B - A New Technique
1633A - Div 7
268A - Games
1062B - Math
1294C - Product of Three Numbers
749A - Bachgold Problem
1486B - Eastern Exhibition
1363A - Odd Selection
131B - Opposites Attract
490C - Hacking Cypher
158B - Taxi
41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves