Submission #3815848


Source Code Expand

#include<cstdio>
#include<queue>
using namespace std;
struct node
{
	int x,y;
	node(int x1,int y1)
	{
		x=x1;y=y1;
	}
};
queue<node> que;
int n,m,stx,sty,endx,endy;
char s[510][510];
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
bool flag[510][510];
bool bfs()
{
	que.push(node(stx,sty));
	flag[stx][sty]=true;
	while(!que.empty())
	{
		int fx=que.front().x;
		int fy=que.front().y;
		que.pop();
		for(int i=0;i<4;i++)
		{
			int sx=fx+dx[i],sy=fy+dy[i];
			if(sx<1||sy<1||sx>n||sy>m) continue;
			if(flag[sx][sy]) continue;
			if(s[sx][sy]=='#') continue;
			if(sx==endx&&sy==endy) return true;
			que.push(node(sx,sy));
			flag[sx][sy]=true;
		}
	}
	return false;
}
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			scanf(" %c",&s[i][j]);
			if(s[i][j]=='s') stx=i,sty=j;
			if(s[i][j]=='g') endx=i,endy=j;
		}
	}
	if(bfs()) printf("Yes");
	else printf("No");
	return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 100
Code Size 966 Byte
Status AC
Exec Time 18 ms
Memory 768 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 83
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 13 ms 512 KB
01_rnd_01.txt AC 13 ms 640 KB
01_rnd_02.txt AC 15 ms 640 KB
01_rnd_03.txt AC 15 ms 768 KB
01_rnd_04.txt AC 15 ms 640 KB
01_rnd_05.txt AC 12 ms 512 KB
01_rnd_06.txt AC 17 ms 768 KB
01_rnd_07.txt AC 16 ms 768 KB
01_rnd_08.txt AC 12 ms 512 KB
01_rnd_09.txt AC 12 ms 512 KB
01_rnd_10.txt AC 17 ms 768 KB
01_rnd_11.txt AC 12 ms 512 KB
01_rnd_12.txt AC 17 ms 768 KB
01_rnd_13.txt AC 12 ms 512 KB
01_rnd_14.txt AC 12 ms 512 KB
01_rnd_15.txt AC 16 ms 768 KB
01_rnd_16.txt AC 12 ms 512 KB
01_rnd_17.txt AC 18 ms 768 KB
01_rnd_18.txt AC 12 ms 512 KB
01_rnd_19.txt AC 14 ms 640 KB
02_rndhard_00.txt AC 12 ms 512 KB
02_rndhard_01.txt AC 12 ms 512 KB
02_rndhard_02.txt AC 13 ms 640 KB
02_rndhard_03.txt AC 13 ms 640 KB
02_rndhard_04.txt AC 12 ms 512 KB
02_rndhard_05.txt AC 12 ms 512 KB
02_rndhard_06.txt AC 12 ms 512 KB
02_rndhard_07.txt AC 12 ms 512 KB
02_rndhard_08.txt AC 13 ms 640 KB
02_rndhard_09.txt AC 13 ms 640 KB
02_rndhard_10.txt AC 13 ms 640 KB
02_rndhard_11.txt AC 13 ms 640 KB
02_rndhard_12.txt AC 13 ms 512 KB
02_rndhard_13.txt AC 12 ms 512 KB
02_rndhard_14.txt AC 13 ms 640 KB
02_rndhard_15.txt AC 13 ms 640 KB
02_rndhard_16.txt AC 12 ms 512 KB
02_rndhard_17.txt AC 12 ms 512 KB
02_rndhard_18.txt AC 12 ms 512 KB
02_rndhard_19.txt AC 12 ms 512 KB
02_rndhard_20.txt AC 12 ms 512 KB
02_rndhard_21.txt AC 12 ms 512 KB
02_rndhard_22.txt AC 13 ms 640 KB
02_rndhard_23.txt AC 12 ms 512 KB
02_rndhard_24.txt AC 12 ms 512 KB
02_rndhard_25.txt AC 12 ms 512 KB
02_rndhard_26.txt AC 12 ms 512 KB
02_rndhard_27.txt AC 12 ms 512 KB
02_rndhard_28.txt AC 12 ms 512 KB
02_rndhard_29.txt AC 12 ms 512 KB
02_rndhard_30.txt AC 13 ms 512 KB
02_rndhard_31.txt AC 12 ms 512 KB
02_rndhard_32.txt AC 13 ms 512 KB
02_rndhard_33.txt AC 13 ms 512 KB
02_rndhard_34.txt AC 12 ms 512 KB
02_rndhard_35.txt AC 12 ms 512 KB
02_rndhard_36.txt AC 12 ms 512 KB
02_rndhard_37.txt AC 12 ms 512 KB
02_rndhard_38.txt AC 12 ms 512 KB
02_rndhard_39.txt AC 12 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