UVA 10047 - The Monocycle

/******************************************************************
***   Problem       :                                           ***
***   Author        : Shipu Ahamed (Psycho Timekiller)          ***
***   E-mail        : shipuahamed01@gmail.com                   ***
***   University    : BUBT,Dept. of CSE                         ***
***   Team          : BUBT_Psycho                               ***
***   My Blog       : http://shipuahamed.blogspot.com           ***
***   Facebook      : http://www.facebook.com/DeesheharaShipu   ***
******************************************************************/

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;

#define pi 2*acos(0.0)
#define all(v) v.begin(),v.end()

//input
#define si(t) scanf("%d",&t)
#define sl(t) scanf("%lld",&t)
#define sf(t) scanf("%f",&t)
#define sd(t) scanf("%lf",&t)
#define sc(c) scanf("%c",&c)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sll(a,b) scanf("%lld%lld",&a,&b)

//Output
#define P(a) printf("%d\n",a)
#define PL(a) printf("%lld\n",a)
#define PF(a) printf("%f\n",a)
#define PD(a) printf("%lf\n",a)
#define PS(a) printf("%s\n",a)
#define PSN(a) printf("%s ",a)
#define PN(a) printf("%d ",a)
#define PLN(a) printf("%lld ",a)
#define PFN(a) printf("%f ",a)
#define PDN(a) printf("%lf ",a)
#define PP(a,b) printf("%d %d\n",a,b)
#define PPN(a,b) printf("%d %d ",a,b)
#define PPL(a,b) printf("%lld %lld\n",a,b)
#define PPLN(a,b) printf("%lld %lld ",a,b)

#define CP(a) cout< vi;
typedef  vector vll;
typedef  vector vs;
typedef  set si;
typedef  set ss;
typedef  map mii;
typedef  map mll;
typedef  map msi;
typedef  map mci;

template string toString( T Number ){stringstream st;st << Number;return st.str();}
template  T SOD(T n) {__typeof(n) sum=0;for(__typeof(n) i=1;i*i<=n;i++)sum+=(n%i)?0:((i*i==n)?i:i+n/i);return sum;}

//For Define
#define forab(i,a,b) for(__typeof(b) i=(a);i<=(b);i++)
#define for0(i,n) forab(i,0,(n)-1)
#define for1(i,n) forab(i,1,n)
#define rforab(i,b,a) for(__typeof(b) i=(b);i>=(a);i--)
#define rfor0(i,n) rforab(i,(n)-1,0)
#define rfor1(i,n) rforab(i,n,1)
#define forstl(i,s) for(__typeof((s).end()) i=(s).begin(); i != (s).end(); i++)

//Debug
#define dbg(x) cout << #x << " -> " << (x) << endl;
#define dbgsarr(i,a) cout<<#a<<"["< "< "< "<>p ; return p;}

ll pow(ll a,ll b, ll m) { ll res = 1; while(b) { if(b & 1) { res = ( (res % m) * (a % m) ) %m ; } a= ((a%m) * (a%m)) %m; b >>= 1; } return res; }
ll modInverse(ll a, ll m){return pow(a,m-2,m);}

////============ CONSTANT ===============////
#define mx7   10000007
#define mx6   1000006
#define mx5   100005
#define inf   1<<30                                           //infinity value
#define eps   1e-9
#define mx    (100010)
#define mod   1000000007
////=====================================////

int dx[] = {-1,0,1,0};
int dy[] = {0,1,0,-1};

struct node
{
    int x,y,dir=0,time=0,col=0;
};

string s[30];
int vis[30][30][5][5];
int res,r,c;

int bfs(int i,int j)
{
//    puts("OK");
    queueq;

    for0(i,27)
    {
        for0(j,27)
        {
            for0(k,5)
            {
                for0(l,5)
                {
                    vis[i][j][k][l] = INT_MAX;
                }
            }
        }
    }

//    cover(vis,INT_MAX);
    res=INT_MAX;
    node p;
    p.x=i;
    p.y=j;
    q.push(p);
    vis[p.x][p.y][p.dir][p.col] = 0;
    while(!q.empty())
    {
//        puts("OK");
        node u;
        u=q.front();q.pop();

        if(s[u.x][u.y] == 'T' && u.col==0)
        {
            res=min(res,u.time);
            continue;
        }
//        puts("OK");
        node v;
        v.x=u.x+dx[u.dir];
        v.y=u.y+dy[u.dir];
        v.dir=u.dir;
        v.time=u.time+1;
        v.col=(u.col+1)%5;
//        puts("OK");
        if(v.x>=0 && v.x=0 && v.y>s[i];
        }

        int f=0;
        for0(i,r)
        {
            for0(j,c)
            {
                if(s[i][j]=='S')
                {
                    bfs(i,j);
                    f=1;
                    break;
                }
            }
            if(f)
                break;
        }

        if(print)
            nl;

        Case(no);
        if(res==INT_MAX)
        {
            puts("destination not reachable");
        }
        else
        {
            printf("minimum time = %d sec\n",res);
        }
        print=true;
    }

    return 0;
}