Submission #978926
Source Code Expand
#include<iostream> #include<string.h> #include<string> #include<cstdio> #include<stdlib.h> #include<algorithm> #include<stack> #include<queue> #include<vector> #include<cmath> #include<utility> #include<set> #define ll long long int #define ld long double #define INF 1000000000 #define EPS 0.0000000001 #define rep(i,n) for(i=0;i<n;i++) using namespace std; typedef pair<int, int> pii; int main() { int i,j; int h,w; char a[10][10]; cin>>h>>w; rep(i,h) scanf("%s",a[i]); rep(j,w) a[h][j]='.'; rep(i,h) a[i][w]='.'; a[0][0]='.'; i=0; j=0; while(1){ if(i==h-1 && j==w-1)break; if(a[i][j+1]=='#' && a[i+1][j]=='#'){ cout<<"Impossible"<<endl; return 0; } if(a[i][j+1]=='.' && a[i+1][j]=='.'){ cout<<"Impossible"<<endl; return 0; } if(a[i][j+1]=='#'){ j++; a[i][j]='.'; }else{ i++; a[i][j]='.'; } } rep(i,h)rep(j,w) if(a[i][j]=='#'){ cout<<"Impossible"<<endl; return 0; } cout<<"Possible"<<endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Shik and Stone |
User | rika0384 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1103 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:29:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s",a[i]); ^
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 | 2 ms | 256 KB |
001.txt | AC | 3 ms | 256 KB |
002.txt | AC | 2 ms | 256 KB |
003.txt | AC | 2 ms | 256 KB |
004.txt | AC | 2 ms | 256 KB |
005.txt | AC | 2 ms | 256 KB |
006.txt | AC | 2 ms | 256 KB |
007.txt | AC | 3 ms | 256 KB |
008.txt | AC | 2 ms | 256 KB |
009.txt | AC | 2 ms | 256 KB |
010.txt | AC | 3 ms | 256 KB |
011.txt | AC | 2 ms | 256 KB |
012.txt | AC | 2 ms | 256 KB |
013.txt | AC | 2 ms | 256 KB |
014.txt | AC | 2 ms | 256 KB |
015.txt | AC | 2 ms | 256 KB |
016.txt | AC | 3 ms | 256 KB |
017.txt | AC | 3 ms | 256 KB |
018.txt | AC | 2 ms | 256 KB |
example0.txt | AC | 2 ms | 256 KB |
example1.txt | AC | 2 ms | 256 KB |
example2.txt | AC | 2 ms | 256 KB |