Submission #1273563


Source Code Expand

h,w = map(int, raw_input().split())
m = [raw_input() for _ in range(h)]
possible = True
for y in range(h):
    for x in range(w):
        if m[y][x] == '#':
            p = 0
            if y > 0 and m[y-1][x] == '#':
                p += 1
            if x > 0 and m[y][x-1] == '#':
                p += 1
            if not(y == 0 and x == 0) and p != 1:
                possible = False
                break
            n = 0
            if y < h-1 and m[y+1][x] == '#':
                n += 1
            if x < w-1 and m[y][x+1] == '#':
                n += 1
            if not(y == h-1 and x == w-1) and n != 1:
                possible = False
                break
    if not possible:
        break
if possible:
    print 'Possible'
else:
    print 'Impossible'

Submission Info

Submission Time
Task A - Shik and Stone
User onuma
Language Python (2.7.6)
Score 200
Code Size 801 Byte
Status AC
Exec Time 11 ms
Memory 2696 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 10 ms 2696 KB
001.txt AC 10 ms 2696 KB
002.txt AC 10 ms 2696 KB
003.txt AC 10 ms 2696 KB
004.txt AC 10 ms 2696 KB
005.txt AC 10 ms 2696 KB
006.txt AC 10 ms 2696 KB
007.txt AC 10 ms 2696 KB
008.txt AC 10 ms 2696 KB
009.txt AC 10 ms 2696 KB
010.txt AC 10 ms 2696 KB
011.txt AC 10 ms 2696 KB
012.txt AC 10 ms 2696 KB
013.txt AC 10 ms 2696 KB
014.txt AC 10 ms 2696 KB
015.txt AC 11 ms 2696 KB
016.txt AC 10 ms 2696 KB
017.txt AC 10 ms 2696 KB
018.txt AC 10 ms 2696 KB
example0.txt AC 10 ms 2696 KB
example1.txt AC 10 ms 2696 KB
example2.txt AC 10 ms 2696 KB