Submission #978925
Source Code Expand
H,W = map(int,input().split()) grid = [] for i in range(H): grid.append(input()) current = (0,0) good = True for y in range(H): for x in range(W): if grid[y][x] == "#": count = 0 aboveCount = 0 if W-1>x and grid[y][x+1] == "#": count+=1 if H-1>y and grid[y+1][x] == "#": count+=1 if x>0 and grid[y][x-1] == "#": aboveCount+=1 if 0<y and grid[y-1][x] == "#": aboveCount+=1 if (aboveCount==0 and y+x!=0) or (count!=1 and y+x!=H+W-2): good = False break if good: print("Possible") else: print("Impossible")
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | println_hi_ |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 736 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | 24 ms | 3064 KB |
001.txt | AC | 23 ms | 3064 KB |
002.txt | AC | 24 ms | 3064 KB |
003.txt | AC | 24 ms | 3064 KB |
004.txt | AC | 24 ms | 3064 KB |
005.txt | AC | 24 ms | 3064 KB |
006.txt | AC | 23 ms | 3064 KB |
007.txt | AC | 24 ms | 3064 KB |
008.txt | AC | 23 ms | 3064 KB |
009.txt | AC | 23 ms | 3064 KB |
010.txt | AC | 23 ms | 3064 KB |
011.txt | AC | 24 ms | 3064 KB |
012.txt | AC | 24 ms | 3064 KB |
013.txt | AC | 23 ms | 3064 KB |
014.txt | AC | 24 ms | 3064 KB |
015.txt | AC | 23 ms | 3064 KB |
016.txt | AC | 24 ms | 3064 KB |
017.txt | AC | 23 ms | 3064 KB |
018.txt | AC | 24 ms | 3064 KB |
example0.txt | AC | 23 ms | 3064 KB |
example1.txt | AC | 24 ms | 3064 KB |
example2.txt | AC | 23 ms | 3064 KB |