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

Submission #6785007

Source Code Expand

Copy
```#include <iostream>

#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>

#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int i=s;i<n;i++)
#define REP_1(i, n) for(int i=1;i<n+1;i++)
#define bitSearch(bit, n) for(int bit = 0; bit < (1 << N); bit++)
using namespace std;

void printAns(long long a) { cout << a << endl; }

void yesno(bool a) { if (a)cout << "Yes" << endl; else cout << "No" << endl; }

void YESNO(bool a) { if (a)cout << "YES" << endl; else cout << "NO" << endl; }

typedef long long ll;
typedef unsigned long ul;
typedef long double ld;

template<class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}

template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}

//ll INF = 10000000;
//ll mod = 1000000007;//10^9+7

using Graph = vector<vector<pair<int, int>>>;

//Graph G(100100);

string c[510];
bool field[510][510] = {false};

int H, W;

void dfs(int x, int y) {
field[x][y] = true;
vector<int> dx = {-1, 0, 0, 1};
vector<int> dy = {0, -1, 1, 0};
REP(i, 4) {
int nx = x + dx[i];
int ny = y + dy[i];
if (nx < 0 || nx >= H || ny < 0 || ny >= W) { continue; }
if (c[nx][ny] == '#') { continue; }
if (field[nx][ny] == false)
dfs(nx, ny);
}
}

//番号ズレ注意！！
int main() {

cin >> H >> W;
REP(i, H) {
cin >> c[i];
}
int sh, sw, gh, gw;
REP(i, H) {
REP(j, W) {
if (c[i][j] == 's') { sh = i, sw = j; }
if (c[i][j] == 'g') { gh = i, gw = j; }
}
}
dfs(sh, sw);
yesno(field[gh][gw]);

}
```

#### Submission Info

Submission Time 2019-08-09 19:37:21+0900 A - 深さ優先探索 Matsumatsumatsu C++14 (GCC 5.4.1) 100 1887 Byte AC 53 ms 35456 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 1 ms 256 KB
00_min_02.txt 1 ms 256 KB
00_min_03.txt 1 ms 256 KB
00_min_04.txt 1 ms 256 KB
00_min_05.txt 1 ms 256 KB
00_min_06.txt 1 ms 256 KB
00_min_07.txt 1 ms 256 KB
00_min_08.txt 1 ms 256 KB
00_sample_01.txt 1 ms 256 KB
00_sample_02.txt 1 ms 256 KB
00_sample_03.txt 1 ms 256 KB
00_sample_04.txt 1 ms 256 KB
00_sample_05.txt 1 ms 256 KB
01_rnd_00.txt 10 ms 512 KB
01_rnd_01.txt 49 ms 31104 KB
01_rnd_02.txt 35 ms 13440 KB
01_rnd_03.txt 53 ms 35456 KB
01_rnd_04.txt 48 ms 29952 KB
01_rnd_05.txt 10 ms 512 KB
01_rnd_06.txt 32 ms 9728 KB
01_rnd_07.txt 36 ms 15104 KB
01_rnd_08.txt 10 ms 512 KB
01_rnd_09.txt 10 ms 512 KB
01_rnd_10.txt 21 ms 2176 KB
01_rnd_11.txt 10 ms 512 KB
01_rnd_12.txt 44 ms 24576 KB
01_rnd_13.txt 43 ms 23552 KB
01_rnd_14.txt 10 ms 512 KB
01_rnd_15.txt 27 ms 5504 KB
01_rnd_16.txt 10 ms 512 KB
01_rnd_17.txt 25 ms 3840 KB
01_rnd_18.txt 10 ms 512 KB
01_rnd_19.txt 52 ms 34688 KB
02_rndhard_00.txt 10 ms 640 KB
02_rndhard_01.txt 10 ms 640 KB
02_rndhard_02.txt 13 ms 896 KB
02_rndhard_03.txt 12 ms 896 KB
02_rndhard_04.txt 10 ms 512 KB
02_rndhard_05.txt 10 ms 512 KB
02_rndhard_06.txt 10 ms 640 KB
02_rndhard_07.txt 10 ms 512 KB
02_rndhard_08.txt 10 ms 640 KB
02_rndhard_09.txt 10 ms 640 KB
02_rndhard_10.txt 11 ms 640 KB
02_rndhard_11.txt 10 ms 640 KB
02_rndhard_12.txt 10 ms 640 KB
02_rndhard_13.txt 10 ms 640 KB
02_rndhard_14.txt 11 ms 768 KB
02_rndhard_15.txt 11 ms 768 KB
02_rndhard_16.txt 10 ms 512 KB
02_rndhard_17.txt 10 ms 512 KB
02_rndhard_18.txt 10 ms 640 KB
02_rndhard_19.txt 10 ms 640 KB
02_rndhard_20.txt 10 ms 640 KB
02_rndhard_21.txt 10 ms 640 KB
02_rndhard_22.txt 10 ms 768 KB
02_rndhard_23.txt 10 ms 640 KB
02_rndhard_24.txt 10 ms 512 KB
02_rndhard_25.txt 10 ms 512 KB
02_rndhard_26.txt 10 ms 640 KB
02_rndhard_27.txt 10 ms 512 KB
02_rndhard_28.txt 10 ms 640 KB
02_rndhard_29.txt 10 ms 640 KB
02_rndhard_30.txt 10 ms 512 KB
02_rndhard_31.txt 10 ms 512 KB
02_rndhard_32.txt 10 ms 640 KB
02_rndhard_33.txt 10 ms 640 KB
02_rndhard_34.txt 10 ms 512 KB
02_rndhard_35.txt 10 ms 512 KB
02_rndhard_36.txt 10 ms 512 KB
02_rndhard_37.txt 10 ms 512 KB
02_rndhard_38.txt 10 ms 640 KB
02_rndhard_39.txt 10 ms 640 KB
03_rndhardsmall_00.txt 1 ms 256 KB
03_rndhardsmall_01.txt 1 ms 256 KB
03_rndhardsmall_02.txt 1 ms 256 KB
03_rndhardsmall_03.txt 1 ms 256 KB
03_rndhardsmall_04.txt 1 ms 256 KB
03_rndhardsmall_05.txt 1 ms 256 KB
03_rndhardsmall_06.txt 1 ms 256 KB
03_rndhardsmall_07.txt 1 ms 256 KB
03_rndhardsmall_08.txt 1 ms 256 KB
03_rndhardsmall_09.txt 1 ms 256 KB