蓝桥杯 我们的征途是星辰大海 模拟

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 char mp[60][60];
 4 int main() {
 5     int t;
 6     cin >> t;
 7     while (t--) {
 8         int n;
 9         cin >> n;
10         int sx, sy; //S的坐标
11         for (int i = 0; i < n; i++) {
12             for (int j = 0; j < n; j++) {
13                 cin >> mp[i][j];
14                 if (mp[i][j] == ‘S‘) {
15                     sx = i;
16                     sy = j;
17                 }
18             }
19         }
20         int q;
21         cin >> q;
22         while (q--) {
23             bool flag = false;
24             string s;
25             cin >> s;
26             int nowx = sx;
27             int nowy = sy;
28             for (int i = 0; i < s.length(); i++) {
29                 switch (s[i]) {
30                     case ‘L‘:
31                         nowy--;
32                         break;
33                     case ‘R‘:
34                         nowy++;
35                         break;
36                     case ‘U‘:
37                         nowx--;
38                         break;
39                     case ‘D‘:
40                         nowx++;
41                         break;
42                 }
43                 if (mp[nowx][nowy] == ‘#‘) {
44                     cout << "I am dizzy!" << endl;
45                     flag = true;
46                     break;
47                 } else if (nowx < 0 || nowx >= n || nowy < 0 || nowy >= n) {
48                     cout << "I am out!" << endl;
49                     flag = true;
50                     break;
51                 } else if (mp[nowx][nowy] == ‘T‘) {
52                     cout << "I get there!" << endl;
53                     flag = true;
54                     break;
55                 }
56             }
57             if (!flag){
58                 cout << "I have no idea!" << endl;
59             }
60         }
61     }
62     return 0;
63 }