Submission #1479911
Source Code Expand
#include<bits/stdc++.h> typedef long long ll; using namespace std; int MOD = 1000000007; main(){ string s[8]; int H,W,x = 0,y = 0; cin >> H >> W; for(int i = 0;i < H;i++)cin >> s[i]; while(x != W-1 || y != H-1){ s[y][x] = '-'; if(y == H-1 || (x != W-1 && s[y][x+1] == '#'))x++; else y++; } s[H-1][W-1] = '-'; for(int i = 0;i < H;i++){ for(char c:s[i]){ if(c=='#'){ cout << "Impossible" << endl; return 0; } } } cout << "Possible" << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | Bantako |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 600 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
001.txt | AC | 1 ms | 256 KB |
002.txt | AC | 1 ms | 256 KB |
003.txt | AC | 1 ms | 256 KB |
004.txt | AC | 1 ms | 256 KB |
005.txt | AC | 1 ms | 256 KB |
006.txt | AC | 1 ms | 256 KB |
007.txt | AC | 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 | AC | 1 ms | 256 KB |