Submission #1450724


Source Code Expand

H, W = map(int, input().split())
m = [input() for i in range(H)]

cnt = 0
for h in range(H):
    for w in range(W):
        if m[h][w] == '#':
            cnt += 1

def rec(x, y):
    if x == W - 1 and y == H - 1:
        return True

    if m[y][x] != '#':
        return False
    dx = [0, 1]
    dy = [1, 0]

    for i in range(2):
        nx = x + dx[i]
        ny = y + dy[i]
        if 0 <= nx and nx < W and \
           0 <= ny and ny < H:
            ret = rec(nx, ny)
            if ret:
                return ret
    return False


if rec(0, 0) and cnt == H + W - 1:
    print("Possible")
else:
    print("Impossible")

Submission Info

Submission Time
Task A - Shik and Stone
User lol
Language Python (3.4.3)
Score 200
Code Size 664 Byte
Status AC
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 22
Set Name Test Cases
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, example0.txt, example1.txt, example2.txt
Case Name Status Exec Time Memory
000.txt AC 17 ms 3064 KB
001.txt AC 17 ms 3064 KB
002.txt AC 17 ms 3064 KB
003.txt AC 17 ms 3064 KB
004.txt AC 17 ms 3064 KB
005.txt AC 17 ms 3064 KB
006.txt AC 17 ms 3064 KB
007.txt AC 17 ms 3064 KB
008.txt AC 16 ms 3064 KB
009.txt AC 17 ms 3064 KB
010.txt AC 17 ms 3064 KB
011.txt AC 16 ms 3064 KB
012.txt AC 17 ms 3064 KB
013.txt AC 17 ms 3064 KB
014.txt AC 17 ms 3064 KB
015.txt AC 17 ms 3064 KB
016.txt AC 17 ms 3064 KB
017.txt AC 17 ms 3064 KB
018.txt AC 17 ms 3064 KB
example0.txt AC 17 ms 3064 KB
example1.txt AC 17 ms 3064 KB
example2.txt AC 17 ms 3064 KB