自制题目求spj

#include<bits/stdc++.h>
#define f(i,a,b) for(int i=a; i<b; i++)
using namespace std;
char amap[10][10];
int px, py, minstep = 114514;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
char c[4] = {'s','d','w','a'};
string stepmind = "114514";
bool inmap(int a, int b){
	return a>=0 && a<10 && b>=0 && b<10; 
}
void dfs(int x, int y, int step, string s){
	if( amap[x][y] == 'T' ){
		if( step < minstep ){
			minstep = step;
			stepmind = s;
		}
		return ;
	}
	step ++;
	amap[x][y] = '!';
	int nx = x, ny = y;
	f(i,0,4){
		nx = x;
		ny = y;
		while( amap[nx+dx[i]][ny+dy[i]]!='#' && inmap(nx+dx[i],ny+dy[i]) ){
			if( amap[nx+dx[i]][ny+dy[i]] == 'T' ){
				if( step < minstep ){
					minstep = step;
					stepmind = s+c[i];
				}
				return ;
			}
			nx = nx + dx[i];
			ny = ny + dy[i];
		}
		if(amap[nx][ny] != '!'){
            amap[nx][ny] = '!';
            dfs(nx, ny, step, s+c[i]);
            amap[nx][ny] = '.';
        }
	}
	return ;
}
int main(){
	f(i,0,10) f(j,0,10){
		cin >> amap[i][j];
		if( amap[i][j] == 'P' ){
			px = i;
			py = j;
		}
	}
	dfs(px, py, 0, "");
    if( minstep == 114514 ) cout << "NO";
	else {
		cout << stepmind;
		cout << endl << minstep;
	}
	return 0;
}