Submission #3673619


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int m,n;
char maze[501][501];
bool vst[501][501];
int sx,sy,ex,ey;
bool flag=false;

//void read(int &s){
//	s=0;int t=1;
//	int k=getchar();
//	for(;k<'0'||k>'9';){
//		if(k=='-') t=-1;
//		k=getchar();
//	}
//	for(;k>='0'&&k<='9';){
//		s=(s<<1)+(s<<3)+k-'0';
//	}
//	s*=t;
//	return;
//}

void dfs(int x,int y){
	if(vst[x][y]) return;
	vst[x][y]=true;
	if(x==ex&&y==ey){
		flag=true;
		return;
	}
	if(x-1>0&&x-1<=m&&y>0&&y<=n&&maze[x-1][y]!='#'){
		dfs(x-1,y);
		if(flag) return;
	}
	if(x+1>0&&x+1<=m&&y>0&&y<=n&&maze[x+1][y]!='#'){
		dfs(x+1,y);
		if(flag) return;
	}
	if(x>0&&x<=m&&y-1>0&&y-1<=n&&maze[x][y-1]!='#'){
		dfs(x,y-1);
		if(flag) return;
	}
	if(x>0&&x<=m&&y+1>0&&y+1<=n&&maze[x][y+1]!='#'){
		dfs(x,y+1);
		if(flag) return;
	}
}

int main(){
	//read(m);read(n);
	scanf("%d%d",&m,&n);
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			maze[i][j]=getchar();
			if(maze[i][j]=='s'){
				sx=i;sy=j;
			} 
			if(maze[i][j]=='g'){
				ex=i;ey=j;
			}
		}
	}
	dfs(sx,sy);
	if(flag) printf("Yes");
	else printf("No");
	return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 0
Code Size 1153 Byte
Status WA
Exec Time 10 ms
Memory 8064 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&m,&n);
                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 3
WA × 2
AC × 75
WA × 8
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 WA 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 WA 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 WA 1 ms 256 KB
00_sample_03.txt WA 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 3 ms 512 KB
01_rnd_01.txt AC 7 ms 5248 KB
01_rnd_02.txt WA 3 ms 512 KB
01_rnd_03.txt AC 5 ms 3200 KB
01_rnd_04.txt AC 9 ms 7680 KB
01_rnd_05.txt AC 3 ms 512 KB
01_rnd_06.txt AC 6 ms 2304 KB
01_rnd_07.txt AC 6 ms 2688 KB
01_rnd_08.txt AC 3 ms 512 KB
01_rnd_09.txt AC 3 ms 512 KB
01_rnd_10.txt WA 5 ms 1280 KB
01_rnd_11.txt AC 3 ms 512 KB
01_rnd_12.txt AC 7 ms 5248 KB
01_rnd_13.txt AC 10 ms 8064 KB
01_rnd_14.txt AC 3 ms 512 KB
01_rnd_15.txt AC 5 ms 1536 KB
01_rnd_16.txt AC 3 ms 512 KB
01_rnd_17.txt AC 8 ms 2048 KB
01_rnd_18.txt AC 3 ms 512 KB
01_rnd_19.txt AC 6 ms 4096 KB
02_rndhard_00.txt AC 3 ms 512 KB
02_rndhard_01.txt AC 3 ms 512 KB
02_rndhard_02.txt AC 4 ms 768 KB
02_rndhard_03.txt AC 4 ms 768 KB
02_rndhard_04.txt AC 3 ms 512 KB
02_rndhard_05.txt AC 3 ms 512 KB
02_rndhard_06.txt WA 4 ms 896 KB
02_rndhard_07.txt WA 4 ms 896 KB
02_rndhard_08.txt AC 3 ms 512 KB
02_rndhard_09.txt AC 3 ms 512 KB
02_rndhard_10.txt AC 3 ms 512 KB
02_rndhard_11.txt AC 3 ms 512 KB
02_rndhard_12.txt AC 3 ms 512 KB
02_rndhard_13.txt AC 3 ms 512 KB
02_rndhard_14.txt AC 4 ms 640 KB
02_rndhard_15.txt AC 4 ms 640 KB
02_rndhard_16.txt AC 3 ms 640 KB
02_rndhard_17.txt AC 3 ms 512 KB
02_rndhard_18.txt AC 3 ms 512 KB
02_rndhard_19.txt AC 3 ms 512 KB
02_rndhard_20.txt AC 3 ms 512 KB
02_rndhard_21.txt AC 3 ms 512 KB
02_rndhard_22.txt AC 3 ms 512 KB
02_rndhard_23.txt AC 3 ms 512 KB
02_rndhard_24.txt AC 4 ms 768 KB
02_rndhard_25.txt AC 4 ms 768 KB
02_rndhard_26.txt AC 3 ms 512 KB
02_rndhard_27.txt AC 3 ms 512 KB
02_rndhard_28.txt AC 3 ms 512 KB
02_rndhard_29.txt AC 3 ms 512 KB
02_rndhard_30.txt AC 3 ms 512 KB
02_rndhard_31.txt AC 3 ms 512 KB
02_rndhard_32.txt AC 4 ms 640 KB
02_rndhard_33.txt AC 4 ms 640 KB
02_rndhard_34.txt AC 3 ms 640 KB
02_rndhard_35.txt AC 3 ms 640 KB
02_rndhard_36.txt AC 3 ms 512 KB
02_rndhard_37.txt AC 3 ms 512 KB
02_rndhard_38.txt AC 3 ms 640 KB
02_rndhard_39.txt AC 3 ms 640 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