1 #include <cstdio>
  2 #include <cstring>
  3
  4 const int MAXN = 8;
  5 const int MAXSIZE = 10000 + 1;
  6 const char move[5] = "DLRU";   //保证字典序最小
  7 const int dx[] = { 1, 0, 0, -1 };
  8 const int dy[] = { 0, -1, 1, 0 };
  9
 10 int map1[MAXN][MAXN];
 11 int map2[MAXN][MAXN];
 12 int start_x1, start_y1, start_x2, start_y2;
 13 int fa[MAXSIZE];         //记录移动路线
 14 bool vis[MAXSIZE];       //判重
 15 int queue[MAXSIZE];      //队列
 16 int dir[MAXSIZE];        //记录移动方向
 17 char answer[MAXSIZE];    //记录答案
 18
 19 int GetHash( int a, int b, int c, int d )
 20 {
 21     return a * 1000 + b * 100 + c * 10 + d;
 22 }
 23
 24 bool check( int x, int y, int dirc, int (*map)[8] )      //判断是否移动成功
 25 {
 26     if ( dirc == 3 && (( map[x][y] >> 3 ) & 1 ))      return false;
 27     if ( dirc == 2 && (( map[x][y] >> 2 ) & 1 ))      return false;
 28     if ( dirc == 1 &&  ( map[x][y] & 1 ) )            return false;
 29     if ( dirc == 0 && (( map[x][y] >> 1 ) & 1 ))      return false;
 30     return true;
 31 }
 32
 33 bool in( int x, int y, int (*map)[8] )       //判断是否越界，是否掉到洞里
 34 {
 35     if ( x >= 1 && x <= 6 && y >= 1 && y <= 6 ) return ( ( map[x][y] >> 4 ) & 1 );
 36     return false;
 37 }
 38
 39 int BFS()
 40 {
 41     //初始化
 42     memset( vis, false, sizeof(vis) );
 43
 44     int front = 0, rear = 0;
 45     int hash = GetHash( start_x1, start_y1, start_x2, start_y2 );
 46     queue[ rear++ ] = hash;   //头结点入队
 47     vis[hash] = true;
 48     fa[hash] = 0;
 49
 50     while ( front < rear )
 51     {
 52         int temp = queue[front];
 53
 54         int x1 = temp / 1000;
 55         int y1 = ( temp / 100 ) % 10;
 56         int x2 = ( temp / 10 ) % 10;
 57         int y2 = temp % 10;
 58
 59         if ( ( ( map1[x1][y1] >> 6 ) & 1 ) && ( ( map2[x2][y2] >> 6 ) & 1 ) ) return temp;   //判断终点
 60
 61         for ( int i = 0; i < 4; i++ )    //四方向移动
 62         {
 63             int xx1 = x1;
 64             int yy1 = y1;
 65
 66             if ( check(xx1, yy1, i, map1) )
 67             {
 68                 xx1 += dx[i];
 69                 yy1 += dy[i];
 70             }
 71
 72             int xx2 = x2;
 73             int yy2 = y2;
 74
 75             if ( check(xx2, yy2, i, map2) )
 76             {
 77                 xx2 += dx[i];
 78                 yy2 += dy[i];
 79             }
 80
 81             if ( !in(xx1, yy1, map1) || !in( xx2, yy2, map2 ) ) continue;
 82
 83             hash = GetHash( xx1, yy1, xx2, yy2 );
 84
 85             if ( !vis[hash] )   //如果该节点尚未访问，插入队列
 86             {
 87                 queue[ rear++ ] = hash;
 88                 fa[hash] = temp;
 89                 dir[hash] = i;
 90                 vis[hash] = true;
 91             }
 92         }
 93         ++front;
 94     }
 95     return -1;      //如果查找失败，返回-1
 96 }
 97
 98 int main()
 99 {
100     int T;
101     scanf( "%d", &T );
102     for ( int i = 1; i <= 6; i++ )
103         for ( int j = 1; j <= 6; j++ )
104         {
105             scanf( "%d", &map2[i][j] );
106             if ( ( map2[i][j] >> 5 ) & 1 )
107             {
108                 start_x2 = i;
109                 start_y2 = j;
110             }
111         }
112
113     --T;
114     while ( T-- )
115     {
116         memcpy( map1, map2, sizeof(map1) );
117         start_x1 = start_x2;
118         start_y1 = start_y2;
119
120         for ( int i = 1; i <= 6; i++ )
121             for ( int j = 1; j <= 6; j++ )
122             {
123                 scanf( "%d", &map2[i][j] );
124                 if ( ( map2[i][j] >> 5 ) & 1 )
125                 {
126                     start_x2 = i;
127                     start_y2 = j;
128                 }
129             }
130
131         int ans = BFS();
132         if ( ans == -1 ) puts("-1");
133         else
134         {
135             int k = -1;
136             for( int i = ans; fa[i] != 0; i = fa[i] )
137                 answer[ ++k ] = move[ dir[i] ];
138
139             for ( ; k >= 0; k-- ) putchar( answer[k] );
140             putchar('\n');
141         }
142     }
143     return 0;
144 }