Contest Duration: ~ (local time) (90 minutes) Back to Home

Submission #7023574

Source Code Expand

Copy
```// luogu-judger-enable-o2
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int MAX=505;
char map[MAX][MAX];
int dir[4][2]={0,1,1,0,0,-1,-1,0};
int vis[MAX][MAX];
int m,n,dx,dy,xx,yy;
bool dfs(int x,int y){
if(map[x][y]=='g')
return true;
else
{
int wx,wy;
for(int i=0;i<4;i++){
wx=x+dir[i][0];
wy=y+dir[i][1];
if(wx>=0&&wx<n&&wy>=0&&wy<m&&map[wx][wy]!='#'&&!vis[wx][wy]){
vis[wx][wy]=1;
dfs(wx,wy);
}
}
}
}
int main(){
scanf("%d%d",&m,&n);
memset(vis,0,sizeof(vis));
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
scanf("%c",&map[i][j]);
if(map[i][j]=='s'){
dx=i;
dy=j;
vis[i][j]=1;
}
}
}
if(dfs(dx,dy))
printf("Yes\n");
else
{
printf("No\n");
}
return 0;
}```

#### Submission Info

Submission Time 2019-08-19 16:11:58+0900 A - 深さ優先探索 luogu_bot5 C++ (GCC 5.4.1) 0 1001 Byte WA 18 ms 8960 KB

#### Compile Error

```./Main.cpp: In function ‘int main()’:
./Main.cpp:29:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&m,&n);
^
./Main.cpp:33:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%c",&map[i][j]);
^
```

#### Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt
All 0 / 100 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 2 ms 1280 KB
00_min_02.txt 2 ms 1280 KB
00_min_03.txt 2 ms 1280 KB
00_min_04.txt 2 ms 1280 KB
00_min_05.txt 2 ms 1280 KB
00_min_06.txt 2 ms 1280 KB
00_min_07.txt 2 ms 1280 KB
00_min_08.txt 2 ms 1280 KB
00_sample_01.txt 2 ms 1280 KB
00_sample_02.txt 2 ms 1280 KB
00_sample_03.txt 2 ms 1280 KB
00_sample_04.txt 2 ms 1280 KB
00_sample_05.txt 2 ms 1280 KB
01_rnd_00.txt 11 ms 1536 KB
01_rnd_01.txt 18 ms 7552 KB
01_rnd_02.txt 11 ms 1536 KB
01_rnd_03.txt 18 ms 8960 KB
01_rnd_04.txt 18 ms 7168 KB
01_rnd_05.txt 11 ms 1536 KB
01_rnd_06.txt 16 ms 3328 KB
01_rnd_07.txt 17 ms 3968 KB
01_rnd_08.txt 11 ms 1536 KB
01_rnd_09.txt 11 ms 1536 KB
01_rnd_10.txt 14 ms 1664 KB
01_rnd_11.txt 11 ms 1536 KB
01_rnd_12.txt 18 ms 6016 KB
01_rnd_13.txt 18 ms 5888 KB
01_rnd_14.txt 11 ms 1536 KB
01_rnd_15.txt 15 ms 2304 KB
01_rnd_16.txt 11 ms 1536 KB
01_rnd_17.txt 15 ms 2176 KB
01_rnd_18.txt 11 ms 1536 KB
01_rnd_19.txt 18 ms 8704 KB
02_rndhard_00.txt 11 ms 1536 KB
02_rndhard_01.txt 11 ms 1536 KB
02_rndhard_02.txt 11 ms 1536 KB
02_rndhard_03.txt 11 ms 1536 KB
02_rndhard_04.txt 11 ms 1536 KB
02_rndhard_05.txt 11 ms 1536 KB
02_rndhard_06.txt 13 ms 1536 KB
02_rndhard_07.txt 13 ms 1536 KB
02_rndhard_08.txt 11 ms 1536 KB
02_rndhard_09.txt 11 ms 1536 KB
02_rndhard_10.txt 11 ms 1536 KB
02_rndhard_11.txt 11 ms 1536 KB
02_rndhard_12.txt 11 ms 1536 KB
02_rndhard_13.txt 11 ms 1536 KB
02_rndhard_14.txt 11 ms 1536 KB
02_rndhard_15.txt 11 ms 1536 KB
02_rndhard_16.txt 11 ms 1536 KB
02_rndhard_17.txt 11 ms 1536 KB
02_rndhard_18.txt 11 ms 1536 KB
02_rndhard_19.txt 11 ms 1536 KB
02_rndhard_20.txt 11 ms 1536 KB
02_rndhard_21.txt 11 ms 1536 KB
02_rndhard_22.txt 11 ms 1536 KB
02_rndhard_23.txt 11 ms 1536 KB
02_rndhard_24.txt 12 ms 1536 KB
02_rndhard_25.txt 11 ms 1536 KB
02_rndhard_26.txt 11 ms 1536 KB
02_rndhard_27.txt 11 ms 1536 KB
02_rndhard_28.txt 11 ms 1536 KB
02_rndhard_29.txt 11 ms 1536 KB
02_rndhard_30.txt 11 ms 1536 KB
02_rndhard_31.txt 11 ms 1536 KB
02_rndhard_32.txt 11 ms 1536 KB
02_rndhard_33.txt 11 ms 1536 KB
02_rndhard_34.txt 11 ms 1536 KB
02_rndhard_35.txt 11 ms 1536 KB
02_rndhard_36.txt 11 ms 1536 KB
02_rndhard_37.txt 11 ms 1536 KB
02_rndhard_38.txt 11 ms 1536 KB
02_rndhard_39.txt 11 ms 1536 KB
03_rndhardsmall_00.txt 2 ms 1280 KB
03_rndhardsmall_01.txt 2 ms 1280 KB
03_rndhardsmall_02.txt 2 ms 1280 KB
03_rndhardsmall_03.txt 2 ms 1280 KB
03_rndhardsmall_04.txt 2 ms 1280 KB
03_rndhardsmall_05.txt 2 ms 1280 KB
03_rndhardsmall_06.txt 2 ms 1280 KB
03_rndhardsmall_07.txt 2 ms 1280 KB
03_rndhardsmall_08.txt 2 ms 1280 KB
03_rndhardsmall_09.txt 2 ms 1280 KB