tj

建议降红
太水了

#include<iostream>
#include<vector>
#include<algorithm>
#include<unordered_map>
#include<queue>
#include<cmath>
#include<stack>
#define ll long long
#define si short int
#define INF 0xffffff
using namespace std;
ll n,m; 
struct node {
	ll dy,dx;
};
unordered_map<char,node> mv = {
	{'T',{0,-1}},
	{'D',{0,1}},
	{'L',{-1,0}},
	{'R',{1,0}}
};
int main() {
	cin>>n>>m;
	vector<vector<bool>> vis(n,vector<bool>(m));
	for(ll i=0;i<n;i++) {
		for(ll j=0;j<m;j++) {
			char t;
			cin>>t;
			vis[i][j]=(t=='X');
		}
	}
	string op;
	cin>>op;
	ll px=0,py=0;
	for(ll i=0;i<op.size();i++) {
		ll nx=px+mv[op[i]].dx,ny=py+mv[op[i]].dy;
		if(nx<0 || nx>=n || ny<0 || ny>=m) cout<<"NO Way!";
		else {
			cout<<"I Can";
			if(vis[nx][ny]) cout<<" do win!";
			px=nx,py=ny;
		}
		cout<<"\n";
	}
}