Submission #34226831

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def main(H, W, G):
    move = {
        "U":lambda h, w: [h-1, w] if h != 0 else None,
        "D":lambda h, w: [h+1, w] if h != H-1 else None,
        "L":lambda h, w: [h, w-1] if w != 0 else None,
        "R":lambda h, w: [h, w+1] if w != W-1 else None,
          0:lambda h, w: -1
    }
    h = 0
    w = 0
    while True:
        nex = move[G[h][w]](h, w)
        if nex == -1: return [nex]
        if nex is None: break
        G[h][w] = 0
        h, w = nex
        
    return [h+1, w+1]
H, W = map(int, input().split())
G = [list(input()) for _ in range(H)]
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def main(H, W, G):
    move = {
        "U":lambda h, w: [h-1, w] if h != 0 else None,
        "D":lambda h, w: [h+1, w] if h != H-1 else None,
        "L":lambda h, w: [h, w-1] if w != 0 else None,
        "R":lambda h, w: [h, w+1] if w != W-1 else None,
          0:lambda h, w: -1
    }
    h = 0
    w = 0
    while True:
        nex = move[G[h][w]](h, w)
        if nex == -1: return [nex]
        if nex is None: break
        G[h][w] = 0
        h, w = nex
        
    return [h+1, w+1]

H, W = map(int, input().split())
G = [list(input()) for _ in range(H)]

print(*main(H, W, G))

Submission Info

Judge Result