Submission #1500508
Source Code Expand
#!/usr/bin/env python3 def solve(h, w, a): b = [] b += [ '.' * (w + 2) ] b += [ '.' + row + '.' for row in a ] b += [ '.' * (w + 2) ] y, x = 1, 1 while (y, x) != (h, w): if b[y - 1][x] == b[y][x - 1] == '#': return False if b[y + 1][x] == b[y][x + 1] == '#': return False if b[y + 1][x] == '#': y += 1 elif b[y][x + 1] == '#': x += 1 else: return False return True h, w = map(int, input().split()) a = [ input() for _ in range(h) ] print(['Impossible', 'Possible'][solve(h, w, a)])
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | kimiyuki |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 632 Byte |
Status | WA |
Exec Time | 17 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 16 ms | 3064 KB |
001.txt | AC | 17 ms | 3064 KB |
002.txt | AC | 16 ms | 3064 KB |
003.txt | AC | 17 ms | 3064 KB |
004.txt | WA | 16 ms | 3064 KB |
005.txt | AC | 16 ms | 3064 KB |
006.txt | AC | 16 ms | 3064 KB |
007.txt | AC | 16 ms | 3064 KB |
008.txt | AC | 17 ms | 3064 KB |
009.txt | AC | 16 ms | 3064 KB |
010.txt | AC | 17 ms | 3064 KB |
011.txt | AC | 17 ms | 3064 KB |
012.txt | AC | 17 ms | 3064 KB |
013.txt | AC | 17 ms | 3064 KB |
014.txt | AC | 16 ms | 3064 KB |
015.txt | AC | 17 ms | 3064 KB |
016.txt | AC | 16 ms | 3064 KB |
017.txt | AC | 17 ms | 3064 KB |
018.txt | AC | 16 ms | 3064 KB |
example0.txt | AC | 17 ms | 3064 KB |
example1.txt | AC | 16 ms | 3064 KB |
example2.txt | AC | 16 ms | 3064 KB |