Contest Duration: ~ (local time) (90 minutes) Back to Home

Submission #420196

Source Code Expand

Copy
```#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <functional>
#include <iostream>
#include <iomanip>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <utility>
#include <vector>

using namespace std;

typedef long long Long;
#define whole(xs) xs.begin(), xs.end()
#define uniq(xs) (xs.erase(unique(xs.begin(), xs.end()), xs.end()))

template<class T>
ostream& operator<<(ostream& os, const vector<T>& vs) {
if (vs.empty()) return os << "[]";
os << "[" << vs[0];
for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
return os << "]";
}

const int IINF = 1<<28;
const Long LINF = 1LL<<56;
#define INF IINF

int H, W;
vector<string> F;
void Input() {
cin >> H >> W;
F.clear(); F.resize(H);
for (int i = 0; i < H; i++) cin >> F[i];
}

int sy, sx;

const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};

const int MAX_H = 501, MAX_W = 501;
bool used[MAX_H][MAX_W];
bool dfs(int y, int x) {
if (F[y][x] == 'g') return true;
used[y][x] = true;
for (int i = 0; i < 4; i++) {
int ny = y + dy[i],
nx = x + dx[i];
if (ny < 0 || ny >= H) continue;
if (nx < 0 || nx >= W) continue;
if (F[ny][nx] == '#') continue;
if (used[ny][nx]) continue;
if (dfs(ny, nx)) return true;
}
return false;
}

void Solve() {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (F[i][j] == 's') {
sy = i;
sx = j;
}
}
}
memset(used, 0, sizeof(used));
cout << (dfs(sy, sx) ? "Yes" : "No") << endl;
}

int main() {
Input(); Solve();
return 0;
}
```

#### Submission Info

Submission Time 2015-06-06 21:05:04+0900 A - 深さ優先探索 izuru C++ (GCC 4.9.2) 100 1846 Byte AC 82 ms 17888 KB

#### Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
 AC × 5
 AC × 83
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 00_min_01.txt, 00_min_02.txt, 00_min_03.txt, 00_min_04.txt, 00_min_05.txt, 00_min_06.txt, 00_min_07.txt, 00_min_08.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 02_rndhard_00.txt, 02_rndhard_01.txt, 02_rndhard_02.txt, 02_rndhard_03.txt, 02_rndhard_04.txt, 02_rndhard_05.txt, 02_rndhard_06.txt, 02_rndhard_07.txt, 02_rndhard_08.txt, 02_rndhard_09.txt, 02_rndhard_10.txt, 02_rndhard_11.txt, 02_rndhard_12.txt, 02_rndhard_13.txt, 02_rndhard_14.txt, 02_rndhard_15.txt, 02_rndhard_16.txt, 02_rndhard_17.txt, 02_rndhard_18.txt, 02_rndhard_19.txt, 02_rndhard_20.txt, 02_rndhard_21.txt, 02_rndhard_22.txt, 02_rndhard_23.txt, 02_rndhard_24.txt, 02_rndhard_25.txt, 02_rndhard_26.txt, 02_rndhard_27.txt, 02_rndhard_28.txt, 02_rndhard_29.txt, 02_rndhard_30.txt, 02_rndhard_31.txt, 02_rndhard_32.txt, 02_rndhard_33.txt, 02_rndhard_34.txt, 02_rndhard_35.txt, 02_rndhard_36.txt, 02_rndhard_37.txt, 02_rndhard_38.txt, 02_rndhard_39.txt, 03_rndhardsmall_00.txt, 03_rndhardsmall_01.txt, 03_rndhardsmall_02.txt, 03_rndhardsmall_03.txt, 03_rndhardsmall_04.txt, 03_rndhardsmall_05.txt, 03_rndhardsmall_06.txt, 03_rndhardsmall_07.txt, 03_rndhardsmall_08.txt, 03_rndhardsmall_09.txt
Case Name Status Exec Time Memory
00_min_01.txt 26 ms 1060 KB
00_min_02.txt 25 ms 1052 KB
00_min_03.txt 26 ms 924 KB
00_min_04.txt 26 ms 940 KB
00_min_05.txt 26 ms 984 KB
00_min_06.txt 26 ms 1052 KB
00_min_07.txt 25 ms 928 KB
00_min_08.txt 26 ms 972 KB
00_sample_01.txt 25 ms 1052 KB
00_sample_02.txt 26 ms 928 KB
00_sample_03.txt 26 ms 932 KB
00_sample_04.txt 23 ms 1052 KB
00_sample_05.txt 25 ms 1052 KB
01_rnd_00.txt 41 ms 1312 KB
01_rnd_01.txt 51 ms 6304 KB
01_rnd_02.txt 48 ms 3748 KB
01_rnd_03.txt 51 ms 6176 KB
01_rnd_04.txt 44 ms 2980 KB
01_rnd_05.txt 41 ms 1312 KB
01_rnd_06.txt 50 ms 3616 KB
01_rnd_07.txt 63 ms 7712 KB
01_rnd_08.txt 40 ms 1316 KB
01_rnd_09.txt 41 ms 1316 KB
01_rnd_10.txt 51 ms 2080 KB
01_rnd_11.txt 48 ms 1308 KB
01_rnd_12.txt 47 ms 3096 KB
01_rnd_13.txt 44 ms 2204 KB
01_rnd_14.txt 42 ms 1316 KB
01_rnd_15.txt 50 ms 3364 KB
01_rnd_16.txt 42 ms 1312 KB
01_rnd_17.txt 53 ms 2856 KB
01_rnd_18.txt 40 ms 1324 KB
01_rnd_19.txt 82 ms 17888 KB
02_rndhard_00.txt 39 ms 1312 KB
02_rndhard_01.txt 40 ms 1324 KB
02_rndhard_02.txt 43 ms 1444 KB
02_rndhard_03.txt 42 ms 1440 KB
02_rndhard_04.txt 41 ms 1240 KB
02_rndhard_05.txt 42 ms 1320 KB
02_rndhard_06.txt 41 ms 1324 KB
02_rndhard_07.txt 40 ms 1320 KB
02_rndhard_08.txt 42 ms 1316 KB
02_rndhard_09.txt 43 ms 1324 KB
02_rndhard_10.txt 41 ms 1320 KB
02_rndhard_11.txt 43 ms 1248 KB
02_rndhard_12.txt 40 ms 1308 KB
02_rndhard_13.txt 43 ms 1316 KB
02_rndhard_14.txt 41 ms 1312 KB
02_rndhard_15.txt 42 ms 1316 KB
02_rndhard_16.txt 39 ms 1312 KB
02_rndhard_17.txt 41 ms 1308 KB
02_rndhard_18.txt 39 ms 1312 KB
02_rndhard_19.txt 41 ms 1312 KB
02_rndhard_20.txt 40 ms 1308 KB
02_rndhard_21.txt 42 ms 1324 KB
02_rndhard_22.txt 42 ms 1320 KB
02_rndhard_23.txt 42 ms 1316 KB
02_rndhard_24.txt 43 ms 1320 KB
02_rndhard_25.txt 41 ms 1312 KB
02_rndhard_26.txt 41 ms 1316 KB
02_rndhard_27.txt 41 ms 1316 KB
02_rndhard_28.txt 41 ms 1320 KB
02_rndhard_29.txt 40 ms 1244 KB
02_rndhard_30.txt 40 ms 1240 KB
02_rndhard_31.txt 41 ms 1248 KB
02_rndhard_32.txt 40 ms 1312 KB
02_rndhard_33.txt 42 ms 1308 KB
02_rndhard_34.txt 50 ms 1276 KB
02_rndhard_35.txt 42 ms 1312 KB
02_rndhard_36.txt 41 ms 1316 KB
02_rndhard_37.txt 42 ms 1308 KB
02_rndhard_38.txt 41 ms 1312 KB
02_rndhard_39.txt 41 ms 1316 KB
03_rndhardsmall_00.txt 27 ms 924 KB
03_rndhardsmall_01.txt 27 ms 1052 KB
03_rndhardsmall_02.txt 27 ms 928 KB
03_rndhardsmall_03.txt 28 ms 1044 KB
03_rndhardsmall_04.txt 26 ms 1048 KB
03_rndhardsmall_05.txt 28 ms 960 KB
03_rndhardsmall_06.txt 25 ms 984 KB
03_rndhardsmall_07.txt 26 ms 924 KB
03_rndhardsmall_08.txt 26 ms 936 KB
03_rndhardsmall_09.txt 25 ms 992 KB