Acdream原创群赛（14）

G.瑶瑶带你玩激光坦克（模拟）

思路：就是普通的模拟，注意可能会出现循环的情况；（直接开三维标记数组即可，或者while达到n*m次退出，说明肯定存在循环）

     最高100万层的递归，改成while 循环就行了！

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <stack>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define LL long long
#define M 1005
#define DEBUG puts("It's here!")
#define INF 1e99
#define eps 1e-10
#define PI acos(-1.0)
#define CLS(x,v) memset(x,v,sizeof(x))
#define FOR(i,a,n)  for(int i=(a);i<=(n);++i)
#define filer freopen("C:\\Users\\sq\\Desktop\\SG Series\\E\\data.in","r",stdin);
#define filew freopen("C:\\Users\\sq\\Desktop\\SG Series\\E\\sq.out","w",stdout);
 
int n,m;
struct point{
  int x,y;
  bool ok()
  { return x>=0&&x<n&&y>=0&&y<m;}
}s;
char g[M][M];
bool flag[M][M];
bool vis[M][M][4];
int dir[4][2]={{1, 0}, {-1, 0}, {0, 1}, {0, -1}};//down, up, right, left
int rev1[4]={3,2,1,0};
int rev2[4]={2,3,0,1};
int DFS(point p,int i)
{
    CLS(vis,0);
    CLS(flag,0);
    vis[p.x][p.y][i]=1;
    point now=p;
    int cnt=0,step=0;
    while(1)
    {
        step++;
        if(step>n*m)break;
        now.x=now.x+dir[i][0];
        now.y=now.y+dir[i][1];
        if(!now.ok()||vis[now.x][now.y][i])break;
        vis[now.x][now.y][i]=1;
        if(g[now.x][now.y]=='*')break;
        else if(g[now.x][now.y]=='E')
        {
            if(flag[now.x][now.y]==0)
            {
                cnt++;
                flag[now.x][now.y]=1;
            }
        }
        else if(g[now.x][now.y]=='/')
            i=rev1[i];
        else if(g[now.x][now.y]=='\\')
            i=rev2[i];
    }
    return cnt;
}
int solve()
{
    int ans=0;
    for(int i=0;i<4;i++)
    {
        ans=max(ans,DFS(s,i));
    }
    return ans;
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=0;i<n;i++)
        {
            scanf("%s",g[i]);
            for(int j=0;j<m;j++)
            if(g[i][j]=='T')
            {
                g[i][j]='.';
                s.x=i;s.y=j;
            }
        }
        printf("%d\n",solve());
    }
    return 0;
}