AI代码： #include #include #include #include #include using namespace std;

const int dx[8] = {-1, -1, 0, 1, 1, 1, 0, -1}; // 8个方向：北、东北、东、东南、南、西南、西、西北 const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};

struct State { int x, y; int steps; int last_dir; // -1表示初始状态，0-7表示8个方向 vector<pair<int, int>> path; };

int main() { int n, m; cin >> n >> m; vector grid(n); int start_x = -1, start_y = -1;

for (int i = 0; i < n; ++i) {
	cin >> grid[i];
	for (int j = 0; j < m; ++j) {
		if (grid[i][j] == '@') {
			start_x = i;
			start_y = j;
		}
	}
}

queue<State> q;
q.push({start_x, start_y, 0, -1, {{start_x, start_y}}});
vector<vector<vector<int>>> visited(n, vector<vector<int>>(m, vector<int>(9, false)));
visited[start_x][start_y][8] = true; // 8表示初始状态

bool found = false;
State result;

while (!q.empty()) {
	State current = q.front();
	q.pop();
	
	if (grid[current.x][current.y] == '$') {
		found = true;
		result = current;
		break;
	}
	
	// 处理移动（8个方向）
	for (int dir = 0; dir < 8; ++dir) {
		int nx = current.x + dx[dir];
		int ny = current.y + dy[dir];
		
		if (nx >= 0 && nx < n && ny >= 0 && ny < m && grid[nx][ny] != '#') {
			if (!visited[nx][ny][dir]) {
				visited[nx][ny][dir] = true;
				State next = current;
				next.x = nx;
				next.y = ny;
				next.steps++;
				next.last_dir = dir;
				next.path.emplace_back(nx, ny);
				q.push(next);
			}
		}
	}
	
	// 处理跳跃（必须与上次移动方向相同）
	if (current.last_dir != -1) {
		int nx = current.x + dx[current.last_dir];
		int ny = current.y + dy[current.last_dir];
		
		if (nx >= 0 && nx < n && ny >= 0 && ny < m && grid[nx][ny] != '#') {
			if (!visited[nx][ny][current.last_dir]) {
				visited[nx][ny][current.last_dir] = true;
				State next = current;
				next.x = nx;
				next.y = ny;
				next.steps++;
				next.path.emplace_back(nx, ny);
				q.push(next);
			}
		}
	}
}

if (found) {
	for (int i = 0; i < result.path.size(); ++i) {
		cout << "(" << result.path[i].first + 1 << "," << result.path[i].second + 1 << ")";
		if (i != result.path.size() - 1) {
			cout << "->";
		}
	}
	cout << endl;
	cout << result.steps << endl;
} else {
	cout << -1 << endl;
}

return 0;

}