1 #include<stdio.h>
 2 #include<string.h>
 3 #include<math.h>
 4 #include<queue>
 5 int T ;
 6 int n , m ;
 7 const int M = 10 ;
 8 int map[M][M] ;
 9 bool vis[M][M][M][M] ;
10 int move[][2] = {{1,0} , {-1 , 0} , {0,1} , {0 , -1} } ;
11 struct node
12 {
13     int x , y ;
14     int a , b ;
15     int time ;
16     bool operator < (const node &rhs ) const
17     {
18         return time > rhs.time ;
19     }
20 };
21
22 int bfs (int sx , int sy , int mx , int my , int ex , int ey)
23 {
24     //printf ("Last---> (%d,%d)\n" , ex , ey ) ;
25     node ans , tmp ;
26     std::priority_queue<node> q ;
27     memset (vis , 0 , sizeof(vis)) ;
28     while ( !q.empty ()) q.pop () ;
29     q.push ( (node) {sx , sy , mx , my , 0}) ;
30     vis[sx][sy][mx][my] = 1 ;
31     if (mx == ex && my == ey) return 0 ;
32     while ( !q.empty ()) {
33         ans = q.top () ; q.pop () ;
34        // printf ("S----(%d,%d) tui (%d,%d)\n" , ans.x , ans.y , ans.a , ans.b ) ;
35         for (int i = 0 ; i < 4 ; i ++) {
36             tmp = ans ;
37             tmp.x += move[i][0] ; tmp.y += move[i][1] ;
38             if (tmp.x < 0 || tmp.y < 0 || tmp.x == n || tmp.y == m) continue ;
39             if (map[tmp.x][tmp.y] == 1 ) continue ;
40             if (tmp.x == tmp.a && tmp.y == tmp.b ) {
41                 int x = tmp.x + move[i][0] , y = tmp.y + move[i][1] ;
42                 if (x < 0 || y < 0 || x == n || y == m) continue ;
43                 if (map[x][y] == 1) continue ;
44                 tmp.a = x , tmp.b = y ;
45                 tmp.time ++ ;
46             }
47             if (vis[tmp.x][tmp.y][tmp.a][tmp.b]) continue ;
48             vis[tmp.x][tmp.y][tmp.a][tmp.b] = 1 ;
49             q.push (tmp ) ;
50            // printf ("(%d,%d) tui (%d,%d)\n" , tmp.x , tmp.y , tmp.a , tmp.b ) ;
51             if (tmp.a == ex && tmp.b == ey) return tmp.time ;
52         }
53     }
54     return - 1 ;
55 }
56
57 int main ()
58 {
59     //freopen ("a.txt" , "r" , stdin ) ;
60     scanf ("%d" , &T ) ;
61     while (T --) {
62         scanf ("%d%d" , &n , &m ) ;
63         int k ;
64         int sx , sy , ex , ey , mx , my ;
65         for (int i = 0 ; i < n ; i ++) for (int j = 0 ; j < m ; j ++) scanf ("%d" , &map[i][j]) ;
66         for (int i = 0 ; i < n ; i ++) {
67             for (int j = 0 ; j < m ; j ++) {
68                 if (map[i][j] == 4) sx = i , sy = j ;
69                 else if (map[i][j] == 2) mx = i , my = j ;
70                 else if (map[i][j] == 3) ex = i , ey = j ;
71             }
72         }
73         if ( (k = bfs (sx , sy , mx , my , ex , ey )) == -1) puts ("-1") ;
74         else printf ("%d\n" , k ) ;
75     }
76     return 0 ;
77 }
78 [ Copy to Clipboard ]    [ Save to File]