Submission #1869782
Source Code Expand
#include <iostream> using namespace std; int H, W; char map[8][8]; bool can[8][8]; int main(void) { cin >> H >> W; for(int y = 0; y < H; y++){ for(int x = 0; x < W; x++){ cin >> map[x][y]; } } can[0][0] = true; for(int y = 0; y < H; y++){ for(int x = 0; x < W; x++){ if(map[x][y] == '.') continue; if(x > 0 && can[x-1][y]) can[x][y] = true; if(y > 0 && can[x][y-1]) can[x][y] = true; } } if(can[W-1][H-1]) cout << "Possible" << endl; else cout << "Impossible" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | leaf1415 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 545 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 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 | WA | 1 ms | 256 KB |
001.txt | WA | 1 ms | 256 KB |
002.txt | WA | 1 ms | 256 KB |
003.txt | WA | 1 ms | 256 KB |
004.txt | WA | 1 ms | 256 KB |
005.txt | WA | 1 ms | 256 KB |
006.txt | WA | 1 ms | 256 KB |
007.txt | WA | 1 ms | 256 KB |
008.txt | AC | 1 ms | 256 KB |
009.txt | AC | 1 ms | 256 KB |
010.txt | AC | 1 ms | 256 KB |
011.txt | AC | 1 ms | 256 KB |
012.txt | AC | 1 ms | 256 KB |
013.txt | AC | 1 ms | 256 KB |
014.txt | AC | 1 ms | 256 KB |
015.txt | AC | 1 ms | 256 KB |
016.txt | AC | 1 ms | 256 KB |
017.txt | AC | 1 ms | 256 KB |
018.txt | AC | 1 ms | 256 KB |
example0.txt | AC | 1 ms | 256 KB |
example1.txt | AC | 1 ms | 256 KB |
example2.txt | WA | 1 ms | 256 KB |