icpc2018-焦作-F Honeycomb bfs

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

就是一个bfs，主要问题是建图，要注意奇数和偶数列的联通方案是略有不同的。比赛的时候写完一直不过样例最后才发现没考虑奇偶，心态炸裂。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<map>
 #include<set>
 #include<stack>
 #include<deque>
 #include<bitset>
 #include<unordered_map>
 #include<unordered_set>
 #include<queue>
 #include<cstdlib>
 #include<ctype.h>
 #include<ctime>
 #include<functional>
 #include<algorithm>
 #include<bits/stdc++.h>
 using namespace std;
 #define LL long long
 #define pii pair<int,int>
 #define mp make_pair
 #define pb push_back
 #define fi first
 #define se second
 #define inf 0x3f3f3f3f
 #define debug puts("debug")
 #define mid ((L+R)>>1)
 #define lc (id<<1)
 #define rc (id<<1|1)
 const int maxn=;
 const int maxm=;
 const double PI=acos(-1.0);
 const double eps=1e-;
 const LL mod=1e9+;
 LL gcd(LL a,LL b){return b==?a:gcd(b,a%b);}
 LL lcm(LL a,LL b){return a/gcd(a,b)*b;}
 LL qpow(LL a,LL b,LL c){LL r=; for(;b;b>>=,a=a*a%c)if(b&)r=r*a%c;return r;}
 struct Edge{int v,w,next;};

 template<class T>
 ostream & operator<<(ostream &out,vector<T>&v){
     for(auto x:v)cout<<x<<' ';
     return out;
 }
 void read(LL &n){
     n=; char c=getchar();
     while(c<''||c>'')c=getchar();
     while(c>=''&&c<='') n=(n<<)+(n<<)+(c-''),c=getchar();
 }
 char e[][];
 vector<int>g[];
 bool vis[];
 int bfs(int S,int T){
     memset(vis,,sizeof(vis));
     queue<pii>q;
     q.push(mp(S,));
     while(!q.empty()){
         pii tmp=q.front();q.pop();
         int u=tmp.fi;
         if(u==T) {return +tmp.se;}
         if(vis[u])continue;
         vis[u]=;
         for(auto v:g[u]){
             q.push(mp(v,tmp.se+));
             }
     }
     return -;
 }
 char centor(int x,int y){
     return e[x+][y+];
 }
 int fx[][][]={{-,,,,,-,,,,-,,},{-,,,,-,-,-,,,-,,}};
 int zb[][]={,,,,,-,,,,-,,};
 char ok[]={'-','-','/','\\','\\','/'};
 void AC(){
     int r,c,i,j,k,u,v;
     int S,T;
     char str[];
     scanf("%d%d",&r,&c);
     getchar();
     for(int i=;i<=*r+;++i){
     gets(e[i]+);
     }
     for(int i=;i<=r*c;++i)g[i].clear();
     for(int i=;i<=r;++i){
         for(int j=;j<=c;++j){
             int id=(i-)*c+j;
             int x1=+(i-)*;
             int y1=;
             if(j%==) x1+=;
             y1=y1+(j-)*;
             if(centor(x1,y1)=='S') S=id;
             else if (centor(x1,y1)=='T') T=id;
             for(int o=;o<;++o){
                 int dx=i+fx[j%][o][];
                 int dy=j+fx[j%][o][];
                 if(dx<||dy<||dx>r||dy>c)continue;
                 int id2=(dx-)*c+dy;
                 //if(id==7&&id2==12)cout<<o<<endl;
                 /*if(id==2){
                     cout<<o<<' '<<x1<<' '<<y1<<' '<<x1+zb[o][0]<<' '
                     <<y1+zb[o][1]<<' '<<e[x1+zb[o][0]][y1+zb[o][1]]<<endl;
                 }*/
                 if(e[x1+zb[o][]][y1+zb[o][]]==ok[o])continue;
                 else {
                     g[id].pb(id2);
                     g[id2].pb(id);
                     //cout<<id<<' '<<id2<<endl;
                 }
             }
         }
     }

     printf("%d\n",bfs(S,T));
 }
 int main(){
     int T;
     cin>>T;
     while(T--)AC();
     return ;
 }
 /*
 1
 3 4
   +---+       +---+
  /     \     /     \
 +       +---+       +---+
  \                       \
   +   +   S   +   +   T   +
  /                       /
 +       +   +       +   +
  \                       \
   +   +       +   +       +
  /                       /
 +       +   +       +   +
  \                       \
   +---+       +---+       +
        \     /     \     /
         +---+       +---+

 */