Submission #978876
Source Code Expand
# include <stdio.h>
# include <string.h>
# include <stdlib.h>
# include <queue>
# include <stack>
# include <map>
# include <math.h>
# include <algorithm>
using namespace std;
# define MAXN 55
# define MAXM 100005
# define INF 1000000000
# define MIN(a,b) (a)>(b)?(b):(a)
# define MAX(a,b) (a)<(b)?(b):(a)
# define mem(a,b) memset(a,b,sizeof(a))
# define FOR(i,a,n) for(int i=a; i<=n; ++i)
# define FO(i,a,n) for(int i=a; i<n; ++i)
# define bug puts("H");
typedef long long LL;
int _MAX(int a, int b){return a>b?a:b;}
int _MIN(int a, int b){return a>b?b:a;}
int a, b, f[10], l[10];
char s[10][10];
int main()
{
scanf("%d%d",&a,&b);
FO(i,0,a) scanf("%s",s[i]);
mem(f,-1); mem(l,-1);
if (s[0][0]!='#'||s[a-1][b-1]!='#') {puts("Impossible"); return 0;}
FO(i,0,a) {
f[i]=0;
int flag=0;
FO(j,0,b) {
if (flag&&s[i][j]=='#'&&s[i][j-1]!='#') {puts("Impossible"); return 0;}
if (s[i][j]=='#'&&flag==0) l[i]=j;
if (s[i][j]=='#') f[i]=j, flag=1;
}
}
FO(i,1,a) {
if (l[i]<f[i-1]||l[i]==-1||f[i]==-1) {puts("Impossible"); return 0;}
}
puts("Possible");
}
Submission Info
Submission Time
2016-11-12 21:13:16+0900
Task
A - Shik and Stone
User
freeloop
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
1201 Byte
Status
AC
Exec Time
1 ms
Memory
128 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:28:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&a,&b);
^
./Main.cpp:29:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
FO(i,0,a) scanf("%s",s[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
1 ms
128 KB
001.txt
AC
1 ms
128 KB
002.txt
AC
1 ms
128 KB
003.txt
AC
1 ms
128 KB
004.txt
AC
1 ms
128 KB
005.txt
AC
1 ms
128 KB
006.txt
AC
1 ms
128 KB
007.txt
AC
1 ms
128 KB
008.txt
AC
1 ms
128 KB
009.txt
AC
1 ms
128 KB
010.txt
AC
1 ms
128 KB
011.txt
AC
1 ms
128 KB
012.txt
AC
1 ms
128 KB
013.txt
AC
1 ms
128 KB
014.txt
AC
1 ms
128 KB
015.txt
AC
1 ms
128 KB
016.txt
AC
1 ms
128 KB
017.txt
AC
1 ms
128 KB
018.txt
AC
1 ms
128 KB
example0.txt
AC
1 ms
128 KB
example1.txt
AC
1 ms
128 KB
example2.txt
AC
1 ms
128 KB