ソースコード 拡げる

Copy
```#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
#define bit_count __builtin_popcount
#define mt make_tuple
inline string zero(int a,string s,char c='0'){return string(a-len(s),c)+s;}
inline string zero(int a,int t,char c='0'){return zero(a, to_string(t), c);}
inline string zero(int a,ll t,char c='0'){return zero(a, to_string(t), c);}
#define mini min_element
#define maxi max_element
#define sum accumulate
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << '\n';}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
constexpr int dx[] = {1, 0, -1,  0};
constexpr int dy[] = {0, 1,  0, -1};
string solve() {
var(int, h, w);
vec(string, c, h);
int sy, sx, gy, gx;
rep(i, 0, h) {
rep(j, 0, w) {
if (c[i][j] == 's') {
sy = i;
sx = j;
c[i][j] = '#';
} else if (c[i][j] == 'g') {
gy = i;
gx = j;
}
}
}
vector<pii> dq{mp(sy, sx)};
int y, x, ny, nx;
while (!dq.empty()) {
tie(y, x) = dq.back(); dq.pop_back();
rep(i, 0, 4) {
ny = y + dy[i];
nx = x + dx[i];
if (0 <= ny && ny < h && 0 <= nx && nx < w && c[ny][nx] != '#') {
if (ny == gy && nx == gx) {
return "Yes";
}
c[ny][nx] = '#';
dq.eb(mp(ny, nx));
}
}
}
return "No";
}
int main() {
print(solve());
return 0;
}
```

#### 提出情報

提出日時 2018-10-30 22:08:47+0900 A - 深さ優先探索 aqua0631 C++14 (GCC 5.4.1) 100 2591 Byte AC 6 ms 1656 KB

#### ジャッジ結果

セット名 Sample All

 AC × 5
 AC × 83
セット名 テストケース
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
ケース名 結果 実行時間 メモリ
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 2 ms 512 KB
01_rnd_01.txt 5 ms 1656 KB
01_rnd_02.txt 2 ms 640 KB
01_rnd_03.txt 5 ms 1656 KB
01_rnd_04.txt 5 ms 1148 KB
01_rnd_05.txt 2 ms 512 KB
01_rnd_06.txt 4 ms 768 KB
01_rnd_07.txt 5 ms 896 KB
01_rnd_08.txt 2 ms 512 KB
01_rnd_09.txt 2 ms 512 KB
01_rnd_10.txt 5 ms 640 KB
01_rnd_11.txt 2 ms 512 KB
01_rnd_12.txt 5 ms 1148 KB
01_rnd_13.txt 5 ms 1148 KB
01_rnd_14.txt 2 ms 512 KB
01_rnd_15.txt 2 ms 512 KB
01_rnd_16.txt 2 ms 512 KB
01_rnd_17.txt 6 ms 640 KB
01_rnd_18.txt 2 ms 512 KB
01_rnd_19.txt 2 ms 640 KB
02_rndhard_00.txt 2 ms 512 KB
02_rndhard_01.txt 2 ms 512 KB
02_rndhard_02.txt 3 ms 512 KB
02_rndhard_03.txt 3 ms 512 KB
02_rndhard_04.txt 2 ms 512 KB
02_rndhard_05.txt 2 ms 512 KB
02_rndhard_06.txt 2 ms 512 KB
02_rndhard_07.txt 2 ms 512 KB
02_rndhard_08.txt 2 ms 512 KB
02_rndhard_09.txt 2 ms 512 KB
02_rndhard_10.txt 2 ms 512 KB
02_rndhard_11.txt 2 ms 512 KB
02_rndhard_12.txt 2 ms 512 KB
02_rndhard_13.txt 2 ms 512 KB
02_rndhard_14.txt 2 ms 512 KB
02_rndhard_15.txt 2 ms 512 KB
02_rndhard_16.txt 2 ms 512 KB
02_rndhard_17.txt 2 ms 512 KB
02_rndhard_18.txt 2 ms 512 KB
02_rndhard_19.txt 2 ms 512 KB
02_rndhard_20.txt 2 ms 512 KB
02_rndhard_21.txt 2 ms 512 KB
02_rndhard_22.txt 2 ms 512 KB
02_rndhard_23.txt 2 ms 512 KB
02_rndhard_24.txt 2 ms 512 KB
02_rndhard_25.txt 2 ms 512 KB
02_rndhard_26.txt 2 ms 512 KB
02_rndhard_27.txt 2 ms 512 KB
02_rndhard_28.txt 2 ms 512 KB
02_rndhard_29.txt 2 ms 512 KB
02_rndhard_30.txt 2 ms 512 KB
02_rndhard_31.txt 2 ms 512 KB
02_rndhard_32.txt 2 ms 512 KB
02_rndhard_33.txt 2 ms 512 KB
02_rndhard_34.txt 2 ms 512 KB
02_rndhard_35.txt 2 ms 512 KB
02_rndhard_36.txt 2 ms 512 KB
02_rndhard_37.txt 2 ms 512 KB
02_rndhard_38.txt 2 ms 512 KB
02_rndhard_39.txt 2 ms 512 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