-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdfsSaveHA.c
More file actions
58 lines (43 loc) · 1.05 KB
/
Copy pathdfsSaveHA.c
File metadata and controls
58 lines (43 loc) · 1.05 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <stdio.h>
int n,m,p,q,min=99999999;
int a[51][51], book[51][51];
void dfs(int x, int y, int step)
{
int next[4][2] = {{1,0},{0,-1},{-1,0},{0,1}};
if(x == p && y == q)
{
if(step < min)
min = step;
return;
}
int tx, ty, k;
for(k=0; k< 4; k++)
{
tx = x+next[k][0];
ty = y+next[k][1];
if(tx < 1 || tx > n || ty < 1|| ty > m)
continue;
if(book[tx][ty] == 0 && a[tx][ty] == 0)
{
book[tx][ty] = 1;
//[x+next[i][0]][y+next[i][1]] == -1;
dfs(tx,ty,step+1);
book[tx][ty] == 0;
}
}
return;
}
int main()
{
int i,j,startx,starty;
scanf("%d %d", &n, &m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d", &a[i][j]);
scanf("%d %d %d %d", &startx, &starty, &p, &q);
book[startx][starty] = 1;
dfs(startx,starty,0);
printf("Min of step is: %d\n", min);
getchar();getchar();
return 0;
}