Submission #3222822
Source Code Expand
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3","sse2","sse")
#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target("f16c")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
//#include "ext/pb_ds/tree_policy.hpp"
//#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define EX0 exit(0);
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ll inf = 1e9+7;
const ld eps = 1e-9;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a) {
if(a<0)return -1;
if(a>0)return 1;
return 0;
}
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename T> inline void in(T &x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
ll twop(int x) {
return 1LL<<x;
}
template<typename A,typename B > inline void in(A&x,B&y) {
in(x);
in(y);
}
template<typename A,typename B,typename C>inline void in(A&x,B&y,C&z) {
in(x);
in(y);
in(z);
}
template<typename A,typename B,typename C,typename D> inline void in(A&x,B&y,C&z,D&d) {
in(x);
in(y);
in(z);
in(d);
}
namespace SOLVE {
void main(){
}
}
int land[1000][1000];
char g[1000][1000];
int main() {
int n,m;cin>>n>>m;
REP(i,0,n)scanf("%s",g[i]);
if(g[0][0] != '#'){
cout<<"Impossible",exit(0);
}
land[0][0] = 1;
PII c = MP(0,0);
while (c != MP(n-1,m-1)) {
if(c.fi <n-1 && g[c.fi+1][c.se] == '#'){
c.fi++;
land[c.fi][c.se] = 1;
}
else if(c.se < m-1 && g[c.fi][c.se+1] == '#'){
c.se++;
land[c.fi][c.se] = 1;
}else{
break;
}
}
REP(i,0,n)REP(j,0,m){
if((g[i][j]=='#')!=land[i][j]){
cout<<"Impossible",exit(0);
}
}
cout<<"Possible";
return 0;
}
Submission Info
Submission Time
2018-09-19 05:18:51+0900
Task
A - Shik and Stone
User
samzhang
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
3719 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:118:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,0,n)scanf("%s",g[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
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