Submission #3788219


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 550;
char a[N][N];
int ans,n,m,vis[N][N];
void dfs(int x, int y)
{	    
	int i;
    if(x<1 || x>n || y<1 || y>m || a[x][y] == '#' || vis[x][y]==1 || ans>0) return;
    if(a[x][y] == 'g') ans++;
    vis[x][y]=1; //标记走过的路     
    dfs(x-1, y);
    dfs(x+1, y);
    dfs(x, y-1);
    dfs(x, y+1);
    //vis[x][y]=0; //回溯走过的路,因为有些路走不通,要往回走, 
}
int main()
{
    int i,j,c,b;
    cin >> n >> m;
    getchar();
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            scanf("%c",&a[i][j]);	
            if(a[i][j]=='s') 
            {
                c=i;b=j;
            }
        }
        getchar();
    }				
    dfs(c, b); //深搜 
    if(ans) cout << "Yes\n";
    else cout << "No\n";
    return 0;
}

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 100
Code Size 893 Byte
Status AC
Exec Time 19 ms
Memory 8832 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%c",&a[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 10 ms 512 KB
01_rnd_01.txt AC 18 ms 7552 KB
01_rnd_02.txt AC 16 ms 4224 KB
01_rnd_03.txt AC 19 ms 8832 KB
01_rnd_04.txt AC 17 ms 6784 KB
01_rnd_05.txt AC 10 ms 512 KB
01_rnd_06.txt AC 15 ms 3584 KB
01_rnd_07.txt AC 15 ms 4096 KB
01_rnd_08.txt AC 10 ms 512 KB
01_rnd_09.txt AC 10 ms 512 KB
01_rnd_10.txt AC 15 ms 2048 KB
01_rnd_11.txt AC 10 ms 512 KB
01_rnd_12.txt AC 18 ms 7296 KB
01_rnd_13.txt AC 16 ms 5504 KB
01_rnd_14.txt AC 10 ms 512 KB
01_rnd_15.txt AC 16 ms 2944 KB
01_rnd_16.txt AC 10 ms 512 KB
01_rnd_17.txt AC 16 ms 2560 KB
01_rnd_18.txt AC 10 ms 512 KB
01_rnd_19.txt AC 12 ms 1920 KB
02_rndhard_00.txt AC 11 ms 640 KB
02_rndhard_01.txt AC 11 ms 640 KB
02_rndhard_02.txt AC 12 ms 1280 KB
02_rndhard_03.txt AC 12 ms 1152 KB
02_rndhard_04.txt AC 10 ms 512 KB
02_rndhard_05.txt AC 10 ms 512 KB
02_rndhard_06.txt AC 11 ms 640 KB
02_rndhard_07.txt AC 10 ms 512 KB
02_rndhard_08.txt AC 11 ms 896 KB
02_rndhard_09.txt AC 11 ms 896 KB
02_rndhard_10.txt AC 11 ms 896 KB
02_rndhard_11.txt AC 11 ms 896 KB
02_rndhard_12.txt AC 11 ms 768 KB
02_rndhard_13.txt AC 11 ms 768 KB
02_rndhard_14.txt AC 11 ms 1024 KB
02_rndhard_15.txt AC 11 ms 1024 KB
02_rndhard_16.txt AC 10 ms 640 KB
02_rndhard_17.txt AC 10 ms 640 KB
02_rndhard_18.txt AC 11 ms 640 KB
02_rndhard_19.txt AC 11 ms 640 KB
02_rndhard_20.txt AC 11 ms 640 KB
02_rndhard_21.txt AC 11 ms 640 KB
02_rndhard_22.txt AC 11 ms 896 KB
02_rndhard_23.txt AC 11 ms 768 KB
02_rndhard_24.txt AC 11 ms 640 KB
02_rndhard_25.txt AC 10 ms 640 KB
02_rndhard_26.txt AC 11 ms 640 KB
02_rndhard_27.txt AC 10 ms 640 KB
02_rndhard_28.txt AC 11 ms 640 KB
02_rndhard_29.txt AC 11 ms 640 KB
02_rndhard_30.txt AC 10 ms 512 KB
02_rndhard_31.txt AC 10 ms 512 KB
02_rndhard_32.txt AC 11 ms 896 KB
02_rndhard_33.txt AC 11 ms 896 KB
02_rndhard_34.txt AC 11 ms 640 KB
02_rndhard_35.txt AC 10 ms 640 KB
02_rndhard_36.txt AC 10 ms 640 KB
02_rndhard_37.txt AC 10 ms 640 KB
02_rndhard_38.txt AC 11 ms 768 KB
02_rndhard_39.txt AC 11 ms 768 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