Submission #1205764
Source Code Expand
#include <cstdio> #include <cstring> #include <vector> #include <queue> #include <string> #include <algorithm> #include <iostream> #include <string> #include <map> #include <set> #include <functional> #include <iostream> #define MOD 1000000007LL using namespace std; typedef long long ll; typedef pair<int,int> P; int h,w; int fie[9][9]; bool flag; bool used[9][9]; void check(int x,int y){ if(fie[y][x]==0)flag=false; used[y][x]=true; if(y==h-1 && x==w-1)return; int cnt=0; if(y<h-1 && fie[y+1][x]==1){ check(x,y+1); cnt++; } if(x<w-1 && fie[y][x+1]==1){ check(x+1,y); cnt++; } if(cnt==2 || cnt==0)flag=false; } int main(void){ scanf("%d%d",&h,&w); for(int i=0;i<h;i++){ string str; cin >> str; for(int j=0;j<w;j++){ if(str[j]=='#')fie[i][j]=1; } } memset(used,false,sizeof(used)); flag=true; check(0,0); for(int i=0;i<h;i++){ for(int j=0;j<w;j++){ if(fie[i][j]==1 && !used[i][j])flag=false; } } printf("%s\n",flag?"Possible":"Impossible"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | ryoissy |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1060 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:40:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d",&h,&w); ^
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 |