Submission #1273538


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 y == h-1 and x == w-1:
            break
        if m[y][x] == '#':
            c = 0
            if y < h-1 and m[y+1][x] == '#':
                c += 1
            if x < w-1 and m[y][x+1] == '#':
                c += 1
            if c != 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 0
Code Size 561 Byte
Status WA
Exec Time 10 ms
Memory 2568 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 3
AC × 20
WA × 2
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 2568 KB
001.txt WA 10 ms 2568 KB
002.txt AC 10 ms 2568 KB
003.txt AC 10 ms 2568 KB
004.txt WA 10 ms 2568 KB
005.txt AC 10 ms 2568 KB
006.txt AC 10 ms 2568 KB
007.txt AC 10 ms 2568 KB
008.txt AC 10 ms 2568 KB
009.txt AC 10 ms 2568 KB
010.txt AC 10 ms 2568 KB
011.txt AC 10 ms 2568 KB
012.txt AC 10 ms 2568 KB
013.txt AC 10 ms 2568 KB
014.txt AC 10 ms 2568 KB
015.txt AC 10 ms 2568 KB
016.txt AC 10 ms 2568 KB
017.txt AC 10 ms 2568 KB
018.txt AC 10 ms 2568 KB
example0.txt AC 10 ms 2568 KB
example1.txt AC 10 ms 2568 KB
example2.txt AC 10 ms 2568 KB