Submission #4268690


Source Code Expand

#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
const int to[4][2]={{-1,0},{0,-1},{1,0},{0,1}};
bool map[505][505],vis[505][505];
int n,m;
struct Point
{
	int x,y;
	Point () = default;
	Point (int a,int b): x(a),y(b){}
	Point operator + (int t)
	{
		return Point(this->x+to[t][0],this->y+to[t][1]);;
	}
	bool operator == (const Point& T)
	{
		return (x==T.x && y==T.y);
	}
	bool check(void)
    {
    	return (x && y && x<=n && y<=m && map[x][y] && !vis[x][y]);
    }
    void Vis()
    {
		vis[x][y]=true;
		return;
	}
}End;
bool BFS(int x,int y)
{
	queue<Point> q;
	q.push(Point(x,y));
	vis[x][y]=true;
	while(!q.empty())
	{
		Point cur=q.front();
		q.pop();
		for(int i=0;i<4;i++)
		{
			Point next=cur+i;
			if(cur==End) return true;
			if(next.check())
			{
				next.Vis();
				q.push(next);
			}
		}
	}
	return false;
}
int main(void)
{
	int sx,sy;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		char temp[505];
		scanf("%s",temp+1);
		for(int j=1;j<=m;j++)
		{
			map[i][j]=(temp[j]!='#');
			if(temp[j]=='s') sx=i,sy=j;
			else if(temp[j]=='g') End.x=i,End.y=j;
		}
	}
	printf("%s",BFS(sx,sy)?"Yes":"No");
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:60:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",temp+1);
                     ^

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 2 ms 512 KB
01_rnd_01.txt AC 3 ms 640 KB
01_rnd_02.txt AC 5 ms 640 KB
01_rnd_03.txt AC 6 ms 768 KB
01_rnd_04.txt AC 5 ms 640 KB
01_rnd_05.txt AC 2 ms 512 KB
01_rnd_06.txt AC 7 ms 768 KB
01_rnd_07.txt AC 6 ms 768 KB
01_rnd_08.txt AC 2 ms 512 KB
01_rnd_09.txt AC 2 ms 512 KB
01_rnd_10.txt AC 7 ms 768 KB
01_rnd_11.txt AC 2 ms 512 KB
01_rnd_12.txt AC 7 ms 768 KB
01_rnd_13.txt AC 2 ms 512 KB
01_rnd_14.txt AC 2 ms 512 KB
01_rnd_15.txt AC 6 ms 768 KB
01_rnd_16.txt AC 2 ms 512 KB
01_rnd_17.txt AC 8 ms 768 KB
01_rnd_18.txt AC 2 ms 512 KB
01_rnd_19.txt AC 4 ms 640 KB
02_rndhard_00.txt AC 2 ms 512 KB
02_rndhard_01.txt AC 2 ms 512 KB
02_rndhard_02.txt AC 4 ms 640 KB
02_rndhard_03.txt AC 3 ms 640 KB
02_rndhard_04.txt AC 2 ms 512 KB
02_rndhard_05.txt AC 2 ms 512 KB
02_rndhard_06.txt AC 2 ms 512 KB
02_rndhard_07.txt AC 2 ms 512 KB
02_rndhard_08.txt AC 3 ms 640 KB
02_rndhard_09.txt AC 3 ms 640 KB
02_rndhard_10.txt AC 3 ms 640 KB
02_rndhard_11.txt AC 3 ms 640 KB
02_rndhard_12.txt AC 3 ms 512 KB
02_rndhard_13.txt AC 3 ms 512 KB
02_rndhard_14.txt AC 3 ms 640 KB
02_rndhard_15.txt AC 3 ms 640 KB
02_rndhard_16.txt AC 2 ms 512 KB
02_rndhard_17.txt AC 2 ms 512 KB
02_rndhard_18.txt AC 2 ms 512 KB
02_rndhard_19.txt AC 2 ms 512 KB
02_rndhard_20.txt AC 2 ms 512 KB
02_rndhard_21.txt AC 2 ms 512 KB
02_rndhard_22.txt AC 3 ms 640 KB
02_rndhard_23.txt AC 3 ms 512 KB
02_rndhard_24.txt AC 2 ms 512 KB
02_rndhard_25.txt AC 2 ms 512 KB
02_rndhard_26.txt AC 2 ms 512 KB
02_rndhard_27.txt AC 2 ms 512 KB
02_rndhard_28.txt AC 2 ms 512 KB
02_rndhard_29.txt AC 2 ms 512 KB
02_rndhard_30.txt AC 2 ms 512 KB
02_rndhard_31.txt AC 2 ms 512 KB
02_rndhard_32.txt AC 3 ms 640 KB
02_rndhard_33.txt AC 3 ms 640 KB
02_rndhard_34.txt AC 2 ms 512 KB
02_rndhard_35.txt AC 2 ms 512 KB
02_rndhard_36.txt AC 2 ms 512 KB
02_rndhard_37.txt AC 2 ms 512 KB
02_rndhard_38.txt AC 2 ms 512 KB
02_rndhard_39.txt AC 2 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