F - Honeycomb Gym - 102028F

 https://cn.vjudge.net/contest/308404#problem/F

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=2e6+9;
const int maxm=4e5+9;
const int mod=1e9+7;

char mp[7009][7009];
bool vis[maxn];
vector<int>g[maxn];
int stx,sty,edx,edy;
int r,c;
int bfs()
{
    for(int i=0;i<=r*c;i++) vis[i]=0;

    queue<pair<int,int> >q;

    int s=(stx-1)*c+sty;
    int t=(edx-1)*c+edy;

    q.push({s,1});

    while(!q.empty())
    {
        pii tmp=q.front();
        q.pop();
        int u=tmp.first;
        int step=tmp.second;

        //cout<<u<<endl;

        if(u==t)
        {
            return step;
        }
        if(vis[u]) continue;
        vis[u]=1;
        for(auto v:g[u])
        {
            if(vis[v]) continue;
            q.push({v,step+1});
        }
    }
    return -1;

}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {
        sfi(r);
        sfi(c);
        getchar();

        for(int i=0;i<=4*r+3;i++)
        {
            for(int j=0;j<=c*6+3;j++)
                mp[i][j]='\0';
        }

        for(int i=1;i<=r*c;i++) g[i].clear();

        for(int i=1;i<=4*r+3;i++)
        {
            gets(mp[i]+1);
        }

        /*for(int i=1;i<=4*r+3;i++)
        {
            for(int j=1;j<=6*c+3;j++)
            {
                cout<<mp[i][j];
            }
            cout<<endl;
        }*/

        for(int i=1;i<=r;i++)
        {
            //cout<<endl;
            for(int j=1;j<=c;j++)
            {
                int id=(i-1)*c+j;

                int x=(i-1)*4+3;
                int y=5+(j-1)*6;
                if(j%2==0)
                {
                    x+=2;
                }


                //cout<<x<<" "<<y<<endl;

                //cout<<mp[x][y];
                //if(mp[x][y]==' ') cout<<"* ";
                //else cout<<mp[x][y]<<" ";

                if(mp[x][y]=='S')
                {
                    stx=i;
                    sty=j;
                    //cout<<i<<" "<<j<<endl;
                }
                if(mp[x][y]=='T')
                {
                    edx=i;
                    edy=j;
                }

                int tx,ty;
                char tc;
                int id2=0;

                tx=x-1;
                ty=y-3;
                tc=mp[tx][ty];
                if(tc!='/')
                {
                    if(j%2==0)
                        id2=(i-1)*c+j-1;
                    else id2=(i-2)*c+j-1;
                    if(!(id2<1||id2>r*c))
                    {
                        g[id].pb(id2);
                        g[id2].pb(id);
                    }

                }

                tx=x-1;
                ty=y+3;
                tc=mp[tx][ty];
                if(tc!='\\')
                {
                    if(j%2==0)
                        id2=(i-1)*c+j+1;
                    else id2=(i-2)*c+j+1;
                    if(!(id2<1||id2>r*c))
                    {
                        g[id].pb(id2);
                        g[id2].pb(id);
                    }

                }

                tx=x+1;
                ty=y-3;
                tc=mp[tx][ty];
                if(tc!='\\')
                {
                    if(j%2==0)
                        id2=(i)*c+j-1;
                    else id2=(i-1)*c+j-1;
                    if(!(id2<1||id2>r*c))
                    {
                        g[id].pb(id2);
                        g[id2].pb(id);
                    }

                }

                tx=x+1;
                ty=y+3;
                tc=mp[tx][ty];
                if(tc!='/')
                {
                    if(j%2==1)
                        id2=(i-1)*c+j+1;
                    else id2=i*c+j+1;
                    if(!(id2<1||id2>r*c))
                    {
                        g[id].pb(id2);
                        g[id2].pb(id);
                    }
                    //cout<<id<<" "<<id2<<endl;

                }

                tx=x+2;
                ty=y;
                tc=mp[tx][ty];
                if(tc!='-')
                {
                    id2=(i)*c+j;
                    if(!(id2<1||id2>r*c))
                    {
                        g[id].pb(id2);
                        g[id2].pb(id);
                    }
                    //cout<<id<<" "<<id2<<endl;
                }

                tx=x-2;
                ty=y;
                tc=mp[tx][ty];
                //cout<<tx<<" "<<ty<<" "<<tc<<endl;
                if(tc!='-')
                {
                    id2=(i-2)*c+j;
                    if(!(id2<1||id2>r*c))
                    {
                        g[id].pb(id2);
                        g[id2].pb(id);
                    }
                    //cout<<id<<" "<<id2<<endl;
                }
            }
        }

        int ans=bfs();
        cout<<ans<<endl;
    }


    return 0;
}