Submission #1358891


Source Code Expand

Copy
#include<string>
#include<iostream>
#include<algorithm>
#include<set>
#include<unordered_set>
#include<math.h>
#include<vector>
#include<sstream>
#include<queue>
#include<functional>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<stack>
#include <cstring>
#include <climits>
using namespace std;
#define rep(i,n) for(int (i)=0;(i) < (n); (i)++)
#define rrep(f,i,n) for(int (i)=0;(i) < (f); (i)++)
#define FIND(v, k) find((v).begin(), (v).end(), k)
#define mset(a,x) memset(a,x,sizeof(a))

#define MAX 101
#define MAX_V 15

string b[500];
int main()
{
	int h, w;
	string s;
	cin >> h >> w;
	rep(i, h) {
		cin >> s;
		b[i] = s;
	}
	pair<int, int> st;
	pair<int, int> gl;
	rep(i, h) {
		rep(j, w) {
			if (b[i][j] == 's') {
				st = make_pair(i, j);
				goto END;
			}
		}
	}
END:;
	queue<pair<int, int>> q;
	q.push(st);
	int of[] = { 1,0,-1,0,1 };
	while (!q.empty()) {
		int cy = q.front().first;
		int cx = q.front().second;
		q.pop();
		rep(i, 4) {
			int ny = cy + of[i];
			int nx = cx + of[i+1];
			if (ny >= h || nx >= w || ny < 0 || nx < 0) continue;
			if (b[ny][nx] == '.') {
				b[ny][nx] = '#';
				q.push(make_pair(ny, nx));
			}
			else if (b[ny][nx] == 'g') {
				cout << "Yes" << endl;
				return 0;
			}
		}
	}
	cout << "No" << endl;
	return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User iroha168
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1348 Byte
Status
Exec Time 14 ms
Memory 512 KB

Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 100 / 100 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 10 ms 512 KB
01_rnd_02.txt 12 ms 512 KB
01_rnd_03.txt 13 ms 512 KB
01_rnd_04.txt 11 ms 512 KB
01_rnd_05.txt 9 ms 512 KB
01_rnd_06.txt 13 ms 512 KB
01_rnd_07.txt 13 ms 512 KB
01_rnd_08.txt 10 ms 512 KB
01_rnd_09.txt 10 ms 512 KB
01_rnd_10.txt 13 ms 512 KB
01_rnd_11.txt 10 ms 512 KB
01_rnd_12.txt 13 ms 512 KB
01_rnd_13.txt 10 ms 512 KB
01_rnd_14.txt 10 ms 512 KB
01_rnd_15.txt 13 ms 512 KB
01_rnd_16.txt 10 ms 512 KB
01_rnd_17.txt 14 ms 512 KB
01_rnd_18.txt 10 ms 512 KB
01_rnd_19.txt 11 ms 512 KB
02_rndhard_00.txt 10 ms 512 KB
02_rndhard_01.txt 10 ms 512 KB
02_rndhard_02.txt 10 ms 512 KB
02_rndhard_03.txt 10 ms 512 KB
02_rndhard_04.txt 10 ms 512 KB
02_rndhard_05.txt 10 ms 512 KB
02_rndhard_06.txt 10 ms 512 KB
02_rndhard_07.txt 10 ms 512 KB
02_rndhard_08.txt 10 ms 512 KB
02_rndhard_09.txt 10 ms 512 KB
02_rndhard_10.txt 10 ms 512 KB
02_rndhard_11.txt 10 ms 512 KB
02_rndhard_12.txt 10 ms 512 KB
02_rndhard_13.txt 10 ms 512 KB
02_rndhard_14.txt 10 ms 512 KB
02_rndhard_15.txt 10 ms 512 KB
02_rndhard_16.txt 11 ms 512 KB
02_rndhard_17.txt 9 ms 512 KB
02_rndhard_18.txt 10 ms 512 KB
02_rndhard_19.txt 10 ms 512 KB
02_rndhard_20.txt 9 ms 512 KB
02_rndhard_21.txt 9 ms 512 KB
02_rndhard_22.txt 10 ms 512 KB
02_rndhard_23.txt 10 ms 512 KB
02_rndhard_24.txt 10 ms 512 KB
02_rndhard_25.txt 10 ms 512 KB
02_rndhard_26.txt 9 ms 512 KB
02_rndhard_27.txt 9 ms 512 KB
02_rndhard_28.txt 10 ms 512 KB
02_rndhard_29.txt 10 ms 512 KB
02_rndhard_30.txt 10 ms 512 KB
02_rndhard_31.txt 10 ms 512 KB
02_rndhard_32.txt 10 ms 512 KB
02_rndhard_33.txt 10 ms 512 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 512 KB
02_rndhard_39.txt 10 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