Honeycomb

Honeycomb

http://codeforces.com/gym/102028/problem/F

time limit per test

4.0 s

memory limit per test

1024 MB

input

standard input

output

standard output

A honeycomb is a mass wax cells built by honey bees, which can be described as a regular tiling of the Euclidean plane, in which three hexagons meet at each internal vertex. The internal angle of a hexagon is 120120 degrees, so three hexagons at a point make a full 360360degrees. The following figure shows a complete honeycomb with 33 rows and 44 columns.

Here we guarantee that the first cell in the second column always locates in the bottom right side of the first cell in the first column, as shown above. A general honeycomb may, on the basis of a complete honeycomb, lose some walls between adjacent cells, but the honeycomb is still in a closed form. A possible case looks like the figure below.

Hamilton is a brave bee living in a general honeycomb. Now he wants to move from a starting point to a specified destination. The image below gives a feasible path in a 3×43×4 honeycomb from the 11-st cell in the 22-nd column to the 11-st cell in the 44-th column.

Please help him find the minimum number of cells that a feasible path has to pass through (including the starting point and the destination) from the specified starting point to the destination.

Input

The input contains several test cases, and the first line contains a positive integer TT indicating the number of test cases which is up to 104104.

For each test case, the first line contains two integers rr and cc indicating the number of rows and the number of columns of the honeycomb, where 2≤r,c≤1032≤r,c≤103.

The following (4r+3)(4r+3) lines describe the whole given honeycomb, where each line contains at most (6c+3)(6c+3) characters. Odd lines contain grid vertices represented as plus signs ("+") and zero or more horizontal edges, while even lines contain two or more diagonal edges. Specifically, a cell is described as 66 vertices and at most 66 edges. Its upper boundary or lower boundary is represented as three consecutive minus signs ("-"). Each one of its diagonal edges, if exists, is a single forward slash ("/") or a single backslash ("\") character. All edge characters will be placed exactly between the corresponding vertices. At the center of the starting cell (resp. the destination), a capital "S" (resp. a capital "T") as a special character is used to indicate the special cell. All other characters will be space characters. Note that if any input line could contain trailing whitespace, that whitespace will be omitted.

We guarantee that all outermost wall exist so that the given honeycomb is closed, and exactly one "S" and one "T" appear in the given honeycomb. Besides, the sum of r⋅cr⋅c in all test cases is up to 2×1062×106.

Output

For each test case, output a line containing the minimum number of cells that Hamilton has to visit moving from the starting cell ("S") to the destination ("T"), including the starting cell and the destination. If no feasible path exists, output -1 instead.

Example

input

Copy

1
3 4
  +---+       +---+
 /     \     /     \
+       +---+       +---+
 \           \     /     \
  +   +   S   +---+   T   +
 /     \     /           /
+       +---+       +   +
 \           \     /     \
  +---+       +---+       +
 /                       /
+       +---+       +   +
 \                 /     \
  +---+       +---+       +
       \     /     \     /
        +---+       +---+

output

Copy

7

比赛的时候煞笔了，没写出来。。。

 #include<iostream>
 #include<cstring>
 #include<string>
 #include<algorithm>
 #include<cmath>
 #include<queue>
 #include<stack>
 #include<cstdio>
 #include<vector>
 using namespace std;

 int n,m,fanwei;
 struct sair{
     int pos,step;
 };

 char str[][];
 int book[];
 vector<int> ve[];

 void bfs(int ss,int tt){
     sair s,e;
     queue<sair>Q;
     s.pos=ss,s.step=;
     book[ss]=;
     Q.push(s);
     while(!Q.empty()){
         s=Q.front();
         Q.pop();
         for(int i=;i<ve[s.pos].size();i++){
             if(ve[s.pos][i]>=&&ve[s.pos][i]<=fanwei&&!book[ve[s.pos][i]]){
                 book[ve[s.pos][i]]=;
                 e.pos=ve[s.pos][i];
                 e.step=s.step+;
                 if(e.pos==tt){
                     printf("%d\n",e.step);
                     return;
                 }
                 Q.push(e);
             }
         }
     }
     printf("-1\n");
 }

 void join(int x,int y){
     ve[x].push_back(y);
     ve[y].push_back(x);
     ////如果wa的话，加单向边试试？？
 }

 int main(){
     int T;
     scanf("%d",&T);
     while(T--){
         scanf("%d %d%*c",&n,&m);
         int tmp=n*m;
         fanwei=tmp;
         for(int i=;i<=tmp;i++){
             book[i]=;
             ve[i].clear();
         }
         for(int i=;i<n*+;i++){
            gets(str[i]);
         }

         //最后三行不用判断
         int nn=n*;
         int co;
         for(int i=;i<nn;i++){
             int len=strlen(str[i]);
             int j=;
             if(i%==){
                 j=;
                 co=;
                 while(j<len){
                     if(str[i][j]==' '){
                         join((i/-)*m+co,i/*m+co);

                     }
                     co+=;
                     j+=;
                 }
             }
             else if(i%==){
                 j=;
                 co=;
                 while(j<len){
                     if(str[i][j]==' '){
                         join((i/-)*m+co-,i/*m+co);
                     }
                     j+=;
                     co+=;
                 }
                 j=;
                 co=;
                 while(j<len){
                     if(str[i][j]==' '){
                         join((i/-)*m+co+,i/*m+co);
                     }
                     j+=;
                     co+=;
                 }
             }
             else if(i%==){
                 co=;
                 j=;
                 while(j<len){
                     if(str[i][j]==' '){
                         join((i/-)*m+co,i/*m+co);
                     }
                     co+=;
                     j+=;
                 }

             }
             else if(i%==){
                 j=;
                 co=;
                 while(j<len){
                     if(str[i][j]==' '){
                         join(i/*m+co,i/*m+co-);
                     }
                     j+=;
                     co+=;
                 }
                 j=;
                 co=;
                 while(j<len){
                     if(str[i][j]==' '){
                         join(i/*m+co,i/*m+co-);

                     }
                     j+=;
                     co+=;
                 }
             }
         }
         int s=-,t=-;
         nn=n*;
         int xxx=;
         for(int i=;i<nn;i+=){
             int len=strlen(str[i]);
             int j=;
             co=xxx*m+;
             xxx++;
             while(j<len){
                 if(str[i][j]=='S'){
                     s=co;
                 }
                 else if(str[i][j]=='T'){
                     t=co;
                 }
                 j+=;
                 co+=;
             }
         }
         nn+=;
         xxx=;
         for(int i=;i<nn;i+=){
             int len=strlen(str[i]);
             int j=;
             co=xxx*m+;
             xxx++;
             while(j<len){
                 if(str[i][j]=='S'){
                     s=co;
                 }
                 else if(str[i][j]=='T'){
                     t=co;
                 }
                 j+=;
                 co+=;
             }
         }
         //cout<<s<<" "<<t<<endl;
         bfs(s,t);
     }

    // system("pause");

     return ;
 }
 /*
 100
 3 4
   +---+       +---+
  /     \     /     \
 +       +---+       +---+
  \           \     /     \
   +   +   S   +---+   T   +
  /     \     /           /
 +       +---+       +   +
  \           \     /     \
   +---+       +---+       +
  /                       /
 +       +---+       +   +
  \                 /     \
   +---+       +---+       +
        \     /     \     /
         +---+       +---+

 3 4
   +---+       +---+
  /     \     /     \
 +       +---+       +---+
  \           \     /     \
   +   +   S   +---+       +
  /     \     /           /
 +       +---+       +   +
  \           \     /     \
   +---+   T   +---+       +
  /           /           /
 +       +---+       +   +
  \                 /     \
   +---+       +---+       +
        \     /     \     /
         +---+       +---+

 3 3
   +---+       +---+
  /     \     /     \
 +       +---+       +
  \           \     /
   +   +   S   +---+
  /     \     /     \
 +       +---+       +
  \           \     /
   +---+   T   +---+
  /           /     \
 +       +---+       +
  \                 /
   +---+       +---+
        \     /
         +---+
 */