Submission #7362832


Source Code Expand

#include <cstdio>
#include <cstring>
#include <iostream>
#define MAXN 500005

using namespace std;

bool p = 0;
int m, n, minn = MAXN;
char mp[505][505];
struct dot
{
	int x, y;
}st, ed;

void sch(int a, int b, int c)
{
	if(p)  return;// 
	if(mp[a+1][b] == '.')
	{
		mp[a+1][b] = '#';
		sch(a+1, b, c+1);
		mp[a+1][b] = '.';
	}
	else if(mp[a+1][b] == 'g')
	{
		minn = min(minn, c+1); p = 1;
		return; 
	}
	if(p)  return;// 
	if(mp[a][b+1] == '.')
	{
		mp[a][b+1] = '#';
		sch(a, b+1, c+1);
		mp[a][b+1] = '.';
	}
	else if(mp[a][b+1] == 'g')
	{
		minn = min(minn, c+1); p = 1;
		return; 
	}
	if(p)  return;// 
	if(mp[a-1][b] == '.')
	{
		mp[a-1][b] = '#';
		sch(a-1, b, c+1);
		mp[a-1][b] = '.';
	}
	else if(mp[a-1][b] == 'g')
	{
		minn = min(minn, c+1); p = 1;
		return; 
	}
	if(p)  return;// 
	if(mp[a][b-1] == '.')
	{
		mp[a][b-1] = '#';
		sch(a, b-1, c+1);
		mp[a][b-1] = '.';
	}
	else if(mp[a][b-1] == 'g')
	{
		minn = min(minn, c+1); p = 1;
		return; 
	}
	if(p)  return;// 
}

int main()
{
	memset(mp, '#', sizeof(mp));
	scanf("%d %d\n", &n, &m);
	for(int i = 1; i <= m; i++)
	{
		for(int j = 1; j <= n; j++)
		{
			scanf("%c", &mp[i][j]);
			if(mp[i][j] == 's')
			{
				st.x = i;  st.y = j;
			}
			if(mp[i][j] == 'g')
			{
				ed.x = i;  ed.y = j;
			}
		}
		if(i != m)  scanf("\n");
	}
	sch(st.x, st.y, 0);
	if(p)  printf("Yes");
	else   printf("No");
	//printf(" %d", minn);
	return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 0
Code Size 1490 Byte
Status WA
Exec Time 2104 ms
Memory 10240 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:72:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d\n", &n, &m);
                          ^
./Main.cpp:77:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%c", &mp[i][j]);
                          ^
./Main.cpp:87:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   if(i != m)  scanf("\n");
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 5
AC × 37
WA × 1
TLE × 45
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 512 KB
00_min_02.txt AC 1 ms 512 KB
00_min_03.txt AC 1 ms 512 KB
00_min_04.txt AC 1 ms 512 KB
00_min_05.txt WA 1 ms 512 KB
00_min_06.txt AC 1 ms 512 KB
00_min_07.txt AC 1 ms 512 KB
00_min_08.txt AC 1 ms 512 KB
00_sample_01.txt AC 1 ms 512 KB
00_sample_02.txt AC 1 ms 512 KB
00_sample_03.txt AC 1 ms 512 KB
00_sample_04.txt AC 1 ms 512 KB
00_sample_05.txt AC 1 ms 512 KB
01_rnd_00.txt AC 11 ms 512 KB
01_rnd_01.txt TLE 2103 ms 1664 KB
01_rnd_02.txt TLE 2103 ms 640 KB
01_rnd_03.txt AC 13 ms 4608 KB
01_rnd_04.txt TLE 2103 ms 1280 KB
01_rnd_05.txt AC 11 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 11 ms 512 KB
01_rnd_09.txt AC 11 ms 512 KB
01_rnd_10.txt TLE 2103 ms 512 KB
01_rnd_11.txt AC 11 ms 512 KB
01_rnd_12.txt TLE 2103 ms 640 KB
01_rnd_13.txt TLE 2103 ms 640 KB
01_rnd_14.txt AC 11 ms 512 KB
01_rnd_15.txt TLE 2103 ms 512 KB
01_rnd_16.txt AC 11 ms 512 KB
01_rnd_17.txt TLE 2103 ms 512 KB
01_rnd_18.txt AC 11 ms 512 KB
01_rnd_19.txt TLE 2104 ms 10240 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 24 ms 512 KB
02_rndhard_05.txt AC 24 ms 512 KB
02_rndhard_06.txt TLE 2103 ms 512 KB
02_rndhard_07.txt AC 11 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 92 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 11 ms 512 KB
02_rndhard_31.txt AC 11 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 512 KB
03_rndhardsmall_01.txt AC 1 ms 512 KB
03_rndhardsmall_02.txt AC 1 ms 512 KB
03_rndhardsmall_03.txt AC 1 ms 512 KB
03_rndhardsmall_04.txt AC 1 ms 512 KB
03_rndhardsmall_05.txt AC 1 ms 512 KB
03_rndhardsmall_06.txt AC 1 ms 512 KB
03_rndhardsmall_07.txt AC 1 ms 512 KB
03_rndhardsmall_08.txt AC 1 ms 512 KB
03_rndhardsmall_09.txt AC 1 ms 512 KB