Submission #6506355


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
static const int MAX = 1001;
static struct Point
{
       int x;
       int y; 
	   inline void zero()
	   {
			x = 0, y = 0;
			return;
	   }      
}depart, detinate;
static int sum = 0;
static int m, n;
static int dx[5] = { 0, 1, -1, 0, 0 };
static int dy[5] = { 0, 0, 0, -1, 1 };
static char grape[MAX][MAX];
static bool visit[MAX][MAX];
inline void dfs(int x, int y); 
int main(void)
{
	scanf("%d%d", &n, &m);
	depart.zero();
	detinate.zero();
	memset(grape, 0, sizeof(grape));
    memset(visit, false, sizeof(visit));
    for (register int i = 1; i <=n; i++)
    {
        for (register int j = 1; j <= m; j++)
        {
        	register char temp;
            scanf("%c", &temp);
            if (temp == '\n') scanf("%c", &temp);
            grape[i][j] = temp;
            if (grape[i][j] == '#') visit[i][j] = true;
            if (grape[i][j] == 's') depart.x = i, depart.y = j;
            if (grape[i][j] == 'g') detinate.x = i, detinate.y = j;
        }
    }
    if (depart.x == 0 and depart.y == 0||depart.x == 0 and depart.y == 0)
    {
    	printf("No");
    	return 0;
	}

    dfs(depart.x, depart.y);
    if (sum != 0) printf("Yes");
    else printf("No");
    return 0;
} 
inline void dfs(int x, int y)
{
	for (register int i = 1; i <= 4; i++)
	{
		register int _x = x + dx[i];
		register int _y = y + dy[i];
		if (_x >= 1 and _x <= n and _y >= 1 and _y <= m and visit[_x][_y] == false)
		{
			visit[_x][_y] = true;
			if (_x == detinate.x and _y == detinate.y) sum++;
			else dfs(_x,_y);
		}
	}
	return;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:35:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%c", &temp);
                               ^
./Main.cpp:36:49: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             if (temp == '\n') scanf("%c", &temp);
                                                 ^

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 2 ms 2176 KB
00_min_02.txt AC 2 ms 2176 KB
00_min_03.txt AC 2 ms 2176 KB
00_min_04.txt AC 2 ms 2176 KB
00_min_05.txt AC 2 ms 2176 KB
00_min_06.txt AC 2 ms 2176 KB
00_min_07.txt AC 2 ms 2176 KB
00_min_08.txt AC 2 ms 2176 KB
00_sample_01.txt AC 2 ms 2176 KB
00_sample_02.txt AC 2 ms 2176 KB
00_sample_03.txt AC 2 ms 2176 KB
00_sample_04.txt AC 2 ms 2176 KB
00_sample_05.txt AC 2 ms 2176 KB
01_rnd_00.txt AC 11 ms 2176 KB
01_rnd_01.txt AC 18 ms 8704 KB
01_rnd_02.txt AC 17 ms 4992 KB
01_rnd_03.txt AC 18 ms 9728 KB
01_rnd_04.txt AC 18 ms 8320 KB
01_rnd_05.txt AC 12 ms 2176 KB
01_rnd_06.txt AC 16 ms 4096 KB
01_rnd_07.txt AC 17 ms 4608 KB
01_rnd_08.txt AC 11 ms 2176 KB
01_rnd_09.txt AC 12 ms 2176 KB
01_rnd_10.txt AC 15 ms 2560 KB
01_rnd_11.txt AC 11 ms 2176 KB
01_rnd_12.txt AC 18 ms 7296 KB
01_rnd_13.txt AC 18 ms 6912 KB
01_rnd_14.txt AC 12 ms 2176 KB
01_rnd_15.txt AC 16 ms 3456 KB
01_rnd_16.txt AC 11 ms 2176 KB
01_rnd_17.txt AC 16 ms 3072 KB
01_rnd_18.txt AC 11 ms 2176 KB
01_rnd_19.txt AC 18 ms 9600 KB
02_rndhard_00.txt AC 12 ms 2176 KB
02_rndhard_01.txt AC 12 ms 2176 KB
02_rndhard_02.txt AC 13 ms 2304 KB
02_rndhard_03.txt AC 13 ms 2304 KB
02_rndhard_04.txt AC 12 ms 2176 KB
02_rndhard_05.txt AC 12 ms 2176 KB
02_rndhard_06.txt AC 12 ms 2176 KB
02_rndhard_07.txt AC 12 ms 2176 KB
02_rndhard_08.txt AC 12 ms 2176 KB
02_rndhard_09.txt AC 12 ms 2176 KB
02_rndhard_10.txt AC 12 ms 2176 KB
02_rndhard_11.txt AC 12 ms 2176 KB
02_rndhard_12.txt AC 12 ms 2176 KB
02_rndhard_13.txt AC 12 ms 2176 KB
02_rndhard_14.txt AC 12 ms 2176 KB
02_rndhard_15.txt AC 12 ms 2176 KB
02_rndhard_16.txt AC 12 ms 2176 KB
02_rndhard_17.txt AC 12 ms 2176 KB
02_rndhard_18.txt AC 12 ms 2176 KB
02_rndhard_19.txt AC 12 ms 2176 KB
02_rndhard_20.txt AC 12 ms 2176 KB
02_rndhard_21.txt AC 12 ms 2176 KB
02_rndhard_22.txt AC 12 ms 2176 KB
02_rndhard_23.txt AC 12 ms 2176 KB
02_rndhard_24.txt AC 12 ms 2176 KB
02_rndhard_25.txt AC 12 ms 2176 KB
02_rndhard_26.txt AC 12 ms 2176 KB
02_rndhard_27.txt AC 12 ms 2176 KB
02_rndhard_28.txt AC 13 ms 2176 KB
02_rndhard_29.txt AC 12 ms 2176 KB
02_rndhard_30.txt AC 12 ms 2176 KB
02_rndhard_31.txt AC 12 ms 2176 KB
02_rndhard_32.txt AC 12 ms 2176 KB
02_rndhard_33.txt AC 12 ms 2176 KB
02_rndhard_34.txt AC 12 ms 2176 KB
02_rndhard_35.txt AC 12 ms 2176 KB
02_rndhard_36.txt AC 12 ms 2176 KB
02_rndhard_37.txt AC 12 ms 2176 KB
02_rndhard_38.txt AC 12 ms 2176 KB
02_rndhard_39.txt AC 12 ms 2176 KB
03_rndhardsmall_00.txt AC 2 ms 2176 KB
03_rndhardsmall_01.txt AC 2 ms 2176 KB
03_rndhardsmall_02.txt AC 2 ms 2176 KB
03_rndhardsmall_03.txt AC 2 ms 2176 KB
03_rndhardsmall_04.txt AC 2 ms 2176 KB
03_rndhardsmall_05.txt AC 2 ms 2176 KB
03_rndhardsmall_06.txt AC 2 ms 2176 KB
03_rndhardsmall_07.txt AC 2 ms 2176 KB
03_rndhardsmall_08.txt AC 2 ms 2176 KB
03_rndhardsmall_09.txt AC 2 ms 2176 KB