.......A................................................M.......

WIN

.......A........................................SS......M.......

LOSE

.......A.................................S......S.......MS......

LOSE、

蛮水的一道BFS，我用BFS写的，DFS也可，我比较菜，对着数据改了好几回QAQ

char mp[101][101];
int x[65],y[65],top=0;
vector <int> vec[105];
int dx[]={0,0,1,-1,-1,1,1,-1,0},dy[]={1,-1,0,0,-1,1,-1,1,0};
struct inof{
int x,y,Step;
}temp;
queue <inof> P;
int vis[64][64][1000];
bool check(int x,int y, int Step)
{
// if(x==0&&y==2)printf("OOOO((((\n");
if(x<0||y<0||x>=8||y>=8)return false;
if(vis[x][y][Step+1])return false;
int siz = vec[y].size();
for(int i=0;i<siz;i++)
{
int tim = x-vec[y][i];
//if(x==0&&y==2)printf("%d^^^%d\n",tim,Step);
/// printf("1");
if(tim<0)continue;
if(tim==Step+1)return false;
if(tim==Step)return false;
}
return true;
}/*
bool che(int x,int y,int Step)
{
int siz = vec[y].size();
for(int i=0;i<siz;i++)
{
int tim = x-vec[y][i];
if(tim==Step+1)return false;
}
return true;
}*/
int main() {
memset(vis,0,sizeof(vis));
for(int i=0;i<8;i++)cin>>mp[i];
for(int i=0;i<8;i++){
for(int j=0;j<8;j++){
if(mp[i][j]=='S')vec[j].push_back(i);
}
}
temp.x=7,temp.y=0,temp.Step=0;
P.push(temp);
while(!P.empty()){
temp = P.front();P.pop(); //if(temp.x==0&&temp.y==1)printf("&&&&&&&&&\n");
//if(!(che(temp.x,temp.y,temp.Step)))continue;
if(mp[temp.x][temp.y]=='A')return 0*printf("WIN");

for(int i=0;i<9;i++){
///printf("1");
int x = temp.x+dx[i],y = temp.y+dy[i];

if(check(x,y,temp.Step))
{
//printf("%d %d\n",x,y);
inof tem;tem.x=x,tem.y=y,tem.Step=temp.Step+1;
P.push(tem);
vis[x][y][temp.Step]=1;
}
}
}
puts("LOSE");
return 0;
}