Submission #11609935


Source Code Expand

#include<iostream>
using namespace std;
bool map[502][502];
int x, y,ex,ey;
bool flag;
int n, m, tot ;
int dx[] = { 0,0,1,-1 }, dy[] = { 1,-1,0,0 };
void dfs(int x, int y, int tot)
{
	if (x == ex && y == ey)
	{
		flag = true;//可以到达
			return;
	}
	if (x<1 || x>n || y<1 || y>m) return;//越图了
	if (tot >= m * n) return;//走太多了
	for (int i = 0; i < 4; i++)
	{
		int tx = x + dx[i];
		int ty = y + dy[i];
		if (map[tx][ty] == false)
		{
			map[tx][ty] = true;
			dfs(tx, ty, tot++);
			map[tx][ty] = false;
		}
	}
}
int main()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			char c;
			cin >> c;
			if (c == 's') x = i, y = j;
			if (c == 'g')ex = i, ey = j;
			if (c == '#') map[i][j] = true;//true代表不能走
		}
	}
	dfs(x, y, 0);
	if (flag == true) cout << "Yes" << endl;
	else cout << "No" << endl;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 910 Byte
Status TLE
Exec Time 2103 ms
Memory 1280 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 5
AC × 37
TLE × 46
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 AC 1 ms 256 KB
00_min_02.txt AC 1 ms 256 KB
00_min_03.txt AC 1 ms 256 KB
00_min_04.txt AC 1 ms 256 KB
00_min_05.txt AC 1 ms 256 KB
00_min_06.txt AC 1 ms 256 KB
00_min_07.txt AC 1 ms 256 KB
00_min_08.txt AC 1 ms 256 KB
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 1 ms 256 KB
00_sample_05.txt AC 1 ms 256 KB
01_rnd_00.txt AC 15 ms 512 KB
01_rnd_01.txt TLE 2103 ms 512 KB
01_rnd_02.txt TLE 2103 ms 512 KB
01_rnd_03.txt TLE 2103 ms 1280 KB
01_rnd_04.txt TLE 2103 ms 640 KB
01_rnd_05.txt AC 16 ms 512 KB
01_rnd_06.txt TLE 2103 ms 640 KB
01_rnd_07.txt TLE 2103 ms 512 KB
01_rnd_08.txt AC 15 ms 512 KB
01_rnd_09.txt AC 15 ms 512 KB
01_rnd_10.txt TLE 2103 ms 512 KB
01_rnd_11.txt AC 15 ms 512 KB
01_rnd_12.txt TLE 2103 ms 512 KB
01_rnd_13.txt TLE 2103 ms 640 KB
01_rnd_14.txt AC 16 ms 512 KB
01_rnd_15.txt TLE 2103 ms 512 KB
01_rnd_16.txt AC 15 ms 512 KB
01_rnd_17.txt TLE 2103 ms 512 KB
01_rnd_18.txt AC 15 ms 512 KB
01_rnd_19.txt TLE 2103 ms 512 KB
02_rndhard_00.txt TLE 2103 ms 512 KB
02_rndhard_01.txt TLE 2103 ms 512 KB
02_rndhard_02.txt TLE 2103 ms 512 KB
02_rndhard_03.txt TLE 2103 ms 512 KB
02_rndhard_04.txt AC 144 ms 512 KB
02_rndhard_05.txt AC 144 ms 512 KB
02_rndhard_06.txt TLE 2103 ms 512 KB
02_rndhard_07.txt AC 17 ms 512 KB
02_rndhard_08.txt TLE 2103 ms 512 KB
02_rndhard_09.txt TLE 2103 ms 512 KB
02_rndhard_10.txt TLE 2103 ms 512 KB
02_rndhard_11.txt TLE 2103 ms 512 KB
02_rndhard_12.txt TLE 2103 ms 512 KB
02_rndhard_13.txt TLE 2103 ms 512 KB
02_rndhard_14.txt TLE 2103 ms 512 KB
02_rndhard_15.txt TLE 2103 ms 512 KB
02_rndhard_16.txt TLE 2103 ms 512 KB
02_rndhard_17.txt TLE 2103 ms 512 KB
02_rndhard_18.txt TLE 2103 ms 512 KB
02_rndhard_19.txt TLE 2103 ms 512 KB
02_rndhard_20.txt TLE 2103 ms 512 KB
02_rndhard_21.txt TLE 2103 ms 512 KB
02_rndhard_22.txt TLE 2103 ms 512 KB
02_rndhard_23.txt TLE 2103 ms 512 KB
02_rndhard_24.txt TLE 2103 ms 512 KB
02_rndhard_25.txt TLE 2103 ms 512 KB
02_rndhard_26.txt TLE 2103 ms 512 KB
02_rndhard_27.txt AC 230 ms 512 KB
02_rndhard_28.txt TLE 2103 ms 512 KB
02_rndhard_29.txt TLE 2103 ms 512 KB
02_rndhard_30.txt AC 16 ms 512 KB
02_rndhard_31.txt AC 16 ms 512 KB
02_rndhard_32.txt TLE 2103 ms 512 KB
02_rndhard_33.txt TLE 2103 ms 512 KB
02_rndhard_34.txt TLE 2103 ms 512 KB
02_rndhard_35.txt TLE 2103 ms 512 KB
02_rndhard_36.txt TLE 2103 ms 512 KB
02_rndhard_37.txt TLE 2103 ms 512 KB
02_rndhard_38.txt TLE 2103 ms 512 KB
02_rndhard_39.txt TLE 2103 ms 512 KB
03_rndhardsmall_00.txt AC 1 ms 256 KB
03_rndhardsmall_01.txt AC 1 ms 256 KB
03_rndhardsmall_02.txt AC 1 ms 256 KB
03_rndhardsmall_03.txt AC 1 ms 256 KB
03_rndhardsmall_04.txt AC 1 ms 256 KB
03_rndhardsmall_05.txt AC 1 ms 256 KB
03_rndhardsmall_06.txt AC 1 ms 256 KB
03_rndhardsmall_07.txt AC 1 ms 256 KB
03_rndhardsmall_08.txt AC 1 ms 256 KB
03_rndhardsmall_09.txt AC 1 ms 256 KB