Submission #978547
Source Code Expand
Copy
#include <bits/stdc++.h>
using namespace std;
#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;using vb=vector<bool>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template <typename T> T read() {T t; cin >> t; return t;}
void Main() {
int h = read<int>();
int w = read<int>();
vector<string> B(h);
rep(i, h) B[i] = read<string>();
int cnt = 0;
rep(y, h) rep(x, w) {
if (B[y][x] == '#') cnt++;
}
if (cnt == h + w - 1) {
cout << "Possible" << endl;
}
else {
cout << "Impossible" << endl;
}
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }
Submission Info
Submission Time |
|
Task |
A - Shik and Stone |
User |
shiratty8 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1449 Byte |
Status |
AC |
Exec Time |
181 ms |
Memory |
764 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 |
181 ms |
764 KB |
001.txt |
AC |
2 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 |
2 ms |
256 KB |
008.txt |
AC |
2 ms |
256 KB |
009.txt |
AC |
2 ms |
256 KB |
010.txt |
AC |
2 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 |
2 ms |
256 KB |
017.txt |
AC |
2 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 |