Submission #1350779
Source Code Expand
import java.util.Scanner; public class Main { static Scanner in = new Scanner(System.in); public static void main(String[] args){ int H = in.nextInt(), W = in.nextInt(); String[] a = new String[H]; a[0] = in.nextLine(); for(int i = 0; i < H; i++){ a[i] = in.nextLine(); } int sum = 0; for(int i = 0; i < H; i++){ for(int j = 0; j < W; j++){ if(a[i].charAt(j) == '#'){ sum++; } } } if(sum == (H + W - 1)){ System.out.println("Possible"); }else{ System.out.println("Impossible"); } } }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | mosmos21 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 565 Byte |
Status | AC |
Exec Time | 95 ms |
Memory | 21972 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 | 93 ms | 19540 KB |
001.txt | AC | 94 ms | 21844 KB |
002.txt | AC | 93 ms | 21844 KB |
003.txt | AC | 93 ms | 20564 KB |
004.txt | AC | 92 ms | 21972 KB |
005.txt | AC | 94 ms | 18900 KB |
006.txt | AC | 91 ms | 18772 KB |
007.txt | AC | 94 ms | 21204 KB |
008.txt | AC | 93 ms | 21716 KB |
009.txt | AC | 93 ms | 19796 KB |
010.txt | AC | 92 ms | 21716 KB |
011.txt | AC | 95 ms | 21588 KB |
012.txt | AC | 92 ms | 21844 KB |
013.txt | AC | 94 ms | 21332 KB |
014.txt | AC | 93 ms | 21716 KB |
015.txt | AC | 93 ms | 21716 KB |
016.txt | AC | 93 ms | 20820 KB |
017.txt | AC | 91 ms | 18644 KB |
018.txt | AC | 93 ms | 20692 KB |
example0.txt | AC | 94 ms | 19792 KB |
example1.txt | AC | 93 ms | 18640 KB |
example2.txt | AC | 92 ms | 21332 KB |