Submission #10501879


Source Code Expand

#include<iostream>
#include<cstdio>
using namespace std;
int n,m,way[4][2]={{-1,0},{0,1},{1,0},{0,-1}};
bool map[500][500]={0};
struct Q
{
  int i,j;
}q[250000];
bool bgo(int i,int j)
{
  if(i<0||i>=n||j<0||j>=m||map[i][j]) return false;
  return true;
}
bool bfs(int fn,int fm,int ln,int lm)
{
  int head=0,tail=0;
  q[head].i=fn;
  q[head].j=fm;
  map[q[head].i][q[head].j]=1;
  if(q[tail].i==ln&&q[tail].j==lm) return true;
  while(head<=tail)
  {
  	for(int i=0;i<4;i++)
  	  if(bgo(q[head].i+way[i][0],q[head].j+way[i][1]))
  	  {
  	  	q[++tail].i=q[head].i+way[i][0];
  	  	q[tail].j=q[head].j+way[i][1];
  	  	map[q[tail].i][q[tail].j]=1;
  	  	if(q[tail].i==ln&&q[tail].j==lm) return true;
	  }
	head++;
  }
  return false;
}
int main()
{
  int fn,fm,ln,lm;
  scanf("%d%d",&n,&m);
  char init;
  for(int i=0;i<n;i++)
    for(int j=0;j<m;j++)
    {
      cin>>init;
      if(init=='s') 
	  {
	  	fn=i;
	  	fm=j;
      }
      if(init=='g') 
	  {
	  	ln=i;
	  	lm=j;
	  }
	  if(init=='#')
	    map[i][j]=1;
    }
  
  if(bfs(fn,fm,ln,lm))
    printf("Yes\n");
  else
    printf("No\n");
  return 0;
} 

Submission Info

Submission Time
Task A - 深さ優先探索
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 100
Code Size 1171 Byte
Status AC
Exec Time 24 ms
Memory 1792 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:39:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
                      ^

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 15 ms 512 KB
01_rnd_01.txt AC 15 ms 640 KB
01_rnd_02.txt AC 17 ms 1024 KB
01_rnd_03.txt AC 18 ms 1792 KB
01_rnd_04.txt AC 17 ms 1152 KB
01_rnd_05.txt AC 16 ms 512 KB
01_rnd_06.txt AC 18 ms 1408 KB
01_rnd_07.txt AC 18 ms 1280 KB
01_rnd_08.txt AC 15 ms 512 KB
01_rnd_09.txt AC 16 ms 512 KB
01_rnd_10.txt AC 18 ms 1280 KB
01_rnd_11.txt AC 14 ms 512 KB
01_rnd_12.txt AC 19 ms 1664 KB
01_rnd_13.txt AC 15 ms 512 KB
01_rnd_14.txt AC 16 ms 512 KB
01_rnd_15.txt AC 18 ms 1152 KB
01_rnd_16.txt AC 15 ms 512 KB
01_rnd_17.txt AC 24 ms 1536 KB
01_rnd_18.txt AC 15 ms 512 KB
01_rnd_19.txt AC 16 ms 1024 KB
02_rndhard_00.txt AC 16 ms 512 KB
02_rndhard_01.txt AC 16 ms 512 KB
02_rndhard_02.txt AC 17 ms 640 KB
02_rndhard_03.txt AC 16 ms 640 KB
02_rndhard_04.txt AC 15 ms 512 KB
02_rndhard_05.txt AC 15 ms 512 KB
02_rndhard_06.txt AC 15 ms 512 KB
02_rndhard_07.txt AC 15 ms 512 KB
02_rndhard_08.txt AC 16 ms 512 KB
02_rndhard_09.txt AC 16 ms 512 KB
02_rndhard_10.txt AC 16 ms 512 KB
02_rndhard_11.txt AC 16 ms 512 KB
02_rndhard_12.txt AC 16 ms 512 KB
02_rndhard_13.txt AC 16 ms 512 KB
02_rndhard_14.txt AC 16 ms 512 KB
02_rndhard_15.txt AC 16 ms 512 KB
02_rndhard_16.txt AC 16 ms 640 KB
02_rndhard_17.txt AC 16 ms 512 KB
02_rndhard_18.txt AC 16 ms 512 KB
02_rndhard_19.txt AC 16 ms 512 KB
02_rndhard_20.txt AC 16 ms 512 KB
02_rndhard_21.txt AC 16 ms 512 KB
02_rndhard_22.txt AC 16 ms 512 KB
02_rndhard_23.txt AC 16 ms 512 KB
02_rndhard_24.txt AC 16 ms 512 KB
02_rndhard_25.txt AC 16 ms 512 KB
02_rndhard_26.txt AC 15 ms 512 KB
02_rndhard_27.txt AC 15 ms 512 KB
02_rndhard_28.txt AC 16 ms 512 KB
02_rndhard_29.txt AC 16 ms 512 KB
02_rndhard_30.txt AC 16 ms 512 KB
02_rndhard_31.txt AC 16 ms 512 KB
02_rndhard_32.txt AC 16 ms 512 KB
02_rndhard_33.txt AC 16 ms 512 KB
02_rndhard_34.txt AC 16 ms 512 KB
02_rndhard_35.txt AC 16 ms 512 KB
02_rndhard_36.txt AC 16 ms 512 KB
02_rndhard_37.txt AC 16 ms 512 KB
02_rndhard_38.txt AC 16 ms 512 KB
02_rndhard_39.txt AC 16 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