Submission #1498656
Source Code Expand
def shik_stone(): h, w = map(int, raw_input().split(" ")) m = [] for i in range(h): m.append(str(raw_input())) current_most_right_index = 0 for row in m: indices = [i for i, ltr in enumerate(row) if ltr == '#'] if min(indices)==current_most_right_index: if len(indices)!=(max(indices)-min(indices)+1): print "Impossible" return else: current_most_right_index = max(indices) else: print "Impossible" return print "Possible" if __name__ == "__main__": shik_stone()
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | zhuang |
Language | Python (2.7.6) |
Score | 200 |
Code Size | 524 Byte |
Status | AC |
Exec Time | 10 ms |
Memory | 2568 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 | 10 ms | 2568 KB |
001.txt | AC | 10 ms | 2568 KB |
002.txt | AC | 10 ms | 2568 KB |
003.txt | AC | 10 ms | 2568 KB |
004.txt | AC | 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 |