Submission #1516862
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
//--------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define LL long long
#define INF INT_MAX/3
//--------------------------------------------
const double EPS = 1e-14;
const double PI = acos(-1.0);
//--------------------------------------------
typedef pair<int, int> p;
vector <string> v;
int d[] = {0, 1, 0, -1, 0};
queue <p> q;
int main(){
int h, w;
string s;
bool flag = true;
scanf("%d %d",&h, &w);
int done[h + 1][w + 1];
REP(i, h + 1) {
REP (j, w + 1) {
done[i][j] = 0;
}
}
REP(i, h) {
cin >> s;
v.push_back(s);
}
q.push(make_pair(0, 0));
while (q.size()) {
int y = q.front().first;
int x = q.front().second;
q.pop();
done[y][x] += 1;
REP(i, 4) {
int dy = y + d[i];
int dx = x + d[i + 1];
if (dy >= 0 && dx >= 0 && dy < h && dx < w && done[dy][dx] == 0 && (dy < y || dx < x) && v.at(dy).at(dx) == '#') {
flag = false;
break;
} else if (dy >= 0 && dx >= 0 && dy < h && dx < w && done[dy][dx] == 0 && v.at(dy).at(dx) == '#') {
q.push(make_pair(dy, dx));
}
}
}
REP(i, h + 1) {
REP (j, w + 1) {
if (done[i][j] > 1) flag = false;
}
}
if (flag) printf("Possible\n");
else printf("Impossible\n");
}
Submission Info
Submission Time
2017-08-17 05:10:40+0900
Task
A - Shik and Stone
User
croonalullaby
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1516 Byte
Status
WA
Exec Time
1 ms
Memory
256 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",&h, &w);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
WA
1 ms
256 KB
003.txt
WA
1 ms
256 KB
004.txt
AC
1 ms
256 KB
005.txt
AC
1 ms
256 KB
006.txt
WA
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