Submission #978913
Source Code Expand
#pragma comment(linker, "/STACK:60777216")
#include <cassert>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<complex>
#include<vector>
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<string>
#include<cstdlib>
#include<memory.h>
#include<ctime>
#include<bitset>
#include<fstream>
#include<queue>
#include<stack>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ld,ld> pdd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef pair<ll,ll> pl;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define SORT(v) sort((v).begin(),(v).end())
#define UN(v) SORT(v),(v).erase(unique((v).begin(),(v).end()),(v).end())
#define CL(a,b) memset(a,b,sizeof a)
#define pb push_back
int n,m;
string s[10];
int main(){
#ifdef LocalHost
freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
#endif
cin>>n>>m;
REP(i,n)cin>>s[i];
vector<pii> v;
REP(i,n)REP(j,m)if(s[i][j]=='#')v.pb(pii(i+j,i*10+j));
SORT(v);
if(v.empty() || v[0].first)puts("Impossible");
else{
FOR(i,1,v.size()){
if(v[i].first!=v[i-1].first+1){puts("Impossible");return 0;}
if(v[i].second!=v[i-1].second+1 && v[i].second!=v[i-1].second+10){puts("Impossible");return 0;}
}
puts("Possible");
}
#ifdef LocalHost
printf("TIME: %.3lf\n",ld(clock())/CLOCKS_PER_SEC);
#endif
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Shik and Stone |
User |
RAVEman |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1525 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
384 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 |
2 ms |
256 KB |
001.txt |
AC |
2 ms |
256 KB |
002.txt |
AC |
2 ms |
256 KB |
003.txt |
AC |
3 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 |
384 KB |