Submission #6752568


Source Code Expand

Copy
#include <iostream>
using namespace std;
	char s[600][600];
	int n,m;
	int stx,sty;
	bool flag=1;
void dfs(int x,int y){
		if(x<1||y<1||x>n||y>m)	return ;
		
		if(s[x+1][y]!='#'&&s[x+1][y]!='!'){
			s[x+1][y]='!';
			dfs(x+1,y);
		}
		
		if(s[x-1][y]!='#'&&s[x-1][y]!='!'){
			s[x-1][y]='!';
			dfs(x-1,y);
		}
		
		if(s[x][y+1]!='#'&&s[x][y+1]!='!'){
			s[x][y+1]='!';
			dfs(x,y+1);
		}
		
		if(s[x][y-1]!='#'&&s[x][y-1]!='!'){
			s[x][y-1]='!';
			dfs(x,y-1);
		}
	}//将s点能走过的地方标记。如果能走到g。则g就要='!'; 
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++){
			cin>>s[i][j];
	if(s[i][j]=='s'){
		stx=i;
		sty=j;
	}
	}
	dfs(stx,sty);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(s[i][j]=='g')
				flag=0;
				
	if(flag)
	cout<<"Yes";
	else
	cout<<"No";
	return 0;
} 

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 100
Code Size 878 Byte
Status
Exec Time 23 ms
Memory 12288 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 15 ms 512 KB
01_rnd_01.txt 22 ms 10880 KB
01_rnd_02.txt 19 ms 4480 KB
01_rnd_03.txt 23 ms 12288 KB
01_rnd_04.txt 22 ms 10240 KB
01_rnd_05.txt 15 ms 512 KB
01_rnd_06.txt 19 ms 3072 KB
01_rnd_07.txt 19 ms 4736 KB
01_rnd_08.txt 15 ms 512 KB
01_rnd_09.txt 15 ms 512 KB
01_rnd_10.txt 17 ms 1152 KB
01_rnd_11.txt 15 ms 512 KB
01_rnd_12.txt 21 ms 7936 KB
01_rnd_13.txt 21 ms 7808 KB
01_rnd_14.txt 15 ms 512 KB
01_rnd_15.txt 18 ms 2176 KB
01_rnd_16.txt 15 ms 512 KB
01_rnd_17.txt 18 ms 1536 KB
01_rnd_18.txt 15 ms 512 KB
01_rnd_19.txt 23 ms 12288 KB
02_rndhard_00.txt 15 ms 512 KB
02_rndhard_01.txt 15 ms 512 KB
02_rndhard_02.txt 15 ms 640 KB
02_rndhard_03.txt 15 ms 640 KB
02_rndhard_04.txt 15 ms 512 KB
02_rndhard_05.txt 15 ms 512 KB
02_rndhard_06.txt 15 ms 512 KB
02_rndhard_07.txt 17 ms 512 KB
02_rndhard_08.txt 15 ms 512 KB
02_rndhard_09.txt 15 ms 512 KB
02_rndhard_10.txt 15 ms 512 KB
02_rndhard_11.txt 15 ms 512 KB
02_rndhard_12.txt 15 ms 512 KB
02_rndhard_13.txt 15 ms 512 KB
02_rndhard_14.txt 15 ms 512 KB
02_rndhard_15.txt 15 ms 640 KB
02_rndhard_16.txt 15 ms 512 KB
02_rndhard_17.txt 15 ms 512 KB
02_rndhard_18.txt 15 ms 512 KB
02_rndhard_19.txt 15 ms 512 KB
02_rndhard_20.txt 15 ms 512 KB
02_rndhard_21.txt 15 ms 512 KB
02_rndhard_22.txt 15 ms 512 KB
02_rndhard_23.txt 15 ms 512 KB
02_rndhard_24.txt 15 ms 512 KB
02_rndhard_25.txt 15 ms 512 KB
02_rndhard_26.txt 15 ms 512 KB
02_rndhard_27.txt 15 ms 512 KB
02_rndhard_28.txt 15 ms 512 KB
02_rndhard_29.txt 15 ms 512 KB
02_rndhard_30.txt 15 ms 512 KB
02_rndhard_31.txt 15 ms 512 KB
02_rndhard_32.txt 15 ms 512 KB
02_rndhard_33.txt 15 ms 512 KB
02_rndhard_34.txt 15 ms 512 KB
02_rndhard_35.txt 15 ms 512 KB
02_rndhard_36.txt 15 ms 512 KB
02_rndhard_37.txt 15 ms 512 KB
02_rndhard_38.txt 15 ms 512 KB
02_rndhard_39.txt 15 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