Submission #1674581


Source Code Expand

Copy
#include<iostream>
#include<queue>
using namespace std;

const int MAX = 500;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
	int H, W;
	cin >> H >> W;
	char c[MAX + 2][MAX + 2];
	for (int i = 0;i <= W + 1;i ++) {
		c[0][i] = '#';
		c[H + 1][i] = '#';
	}
	for (int i = 1;i <= H;i ++) {
		c[i][0] = '#';
		cin >> (c[i]+1);
		c[i][W + 1] = '#';
	}
	queue<pair<int, int> > que;
	for (int i = 0;i <= H + 1;i ++) for (int j = 0;j <= W + 1;j ++) if (c[i][j] == 's') que.push(make_pair(i, j));
	
	pair<int, int> p;
	while(!que.empty()) {
		p = que.front();
		que.pop();
		if (c[p.first][p.second] == 'g') {
			cout << "Yes";
			return 0;
		} else if (c[p.first][p.second] == '#') continue;
		c[p.first][p.second] = '#';
		for (int i = 0;i < 4;i ++) {
			if (c[p.first + dy[i]][p.second + dx[i]] != '#') {
				que.push(make_pair(p.first + dy[i], p.second + dx[i]));
			}
		}
	}
	cout << "No";
	return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User cirno3153
Language C++14 (GCC 5.4.1)
Score 100
Code Size 969 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 2 ms 384 KB
01_rnd_00.txt 9 ms 512 KB
01_rnd_01.txt 9 ms 512 KB
01_rnd_02.txt 11 ms 512 KB
01_rnd_03.txt 12 ms 512 KB
01_rnd_04.txt 11 ms 512 KB
01_rnd_05.txt 8 ms 512 KB
01_rnd_06.txt 12 ms 512 KB
01_rnd_07.txt 12 ms 512 KB
01_rnd_08.txt 9 ms 512 KB
01_rnd_09.txt 8 ms 512 KB
01_rnd_10.txt 12 ms 512 KB
01_rnd_11.txt 9 ms 512 KB
01_rnd_12.txt 13 ms 512 KB
01_rnd_13.txt 9 ms 512 KB
01_rnd_14.txt 8 ms 512 KB
01_rnd_15.txt 11 ms 512 KB
01_rnd_16.txt 9 ms 512 KB
01_rnd_17.txt 14 ms 512 KB
01_rnd_18.txt 8 ms 512 KB
01_rnd_19.txt 10 ms 512 KB
02_rndhard_00.txt 9 ms 512 KB
02_rndhard_01.txt 9 ms 512 KB
02_rndhard_02.txt 9 ms 512 KB
02_rndhard_03.txt 9 ms 512 KB
02_rndhard_04.txt 9 ms 512 KB
02_rndhard_05.txt 9 ms 512 KB
02_rndhard_06.txt 9 ms 512 KB
02_rndhard_07.txt 9 ms 512 KB
02_rndhard_08.txt 9 ms 512 KB
02_rndhard_09.txt 9 ms 512 KB
02_rndhard_10.txt 9 ms 512 KB
02_rndhard_11.txt 9 ms 512 KB
02_rndhard_12.txt 9 ms 512 KB
02_rndhard_13.txt 9 ms 512 KB
02_rndhard_14.txt 9 ms 512 KB
02_rndhard_15.txt 9 ms 512 KB
02_rndhard_16.txt 9 ms 512 KB
02_rndhard_17.txt 9 ms 512 KB
02_rndhard_18.txt 9 ms 512 KB
02_rndhard_19.txt 9 ms 512 KB
02_rndhard_20.txt 9 ms 512 KB
02_rndhard_21.txt 9 ms 512 KB
02_rndhard_22.txt 9 ms 512 KB
02_rndhard_23.txt 9 ms 512 KB
02_rndhard_24.txt 9 ms 512 KB
02_rndhard_25.txt 9 ms 512 KB
02_rndhard_26.txt 9 ms 512 KB
02_rndhard_27.txt 10 ms 512 KB
02_rndhard_28.txt 9 ms 512 KB
02_rndhard_29.txt 9 ms 512 KB
02_rndhard_30.txt 9 ms 512 KB
02_rndhard_31.txt 9 ms 512 KB
02_rndhard_32.txt 9 ms 512 KB
02_rndhard_33.txt 9 ms 512 KB
02_rndhard_34.txt 10 ms 512 KB
02_rndhard_35.txt 9 ms 512 KB
02_rndhard_36.txt 9 ms 512 KB
02_rndhard_37.txt 9 ms 512 KB
02_rndhard_38.txt 9 ms 512 KB
02_rndhard_39.txt 9 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