蓝桥杯真题训练5

蓝桥杯真题训练

1-迷宫1

下图给出了一个迷宫的平面图，其中标记为 11 的为障碍，标记为 00 的为可以通行的地方。

010000
000100
001001
110000

迷宫的入口为左上角，出口为右下角，在迷宫中，只能从一个位置走到这 个它的上、下、左、右四个方向之一。

对于上面的迷宫，从入口开始，可以按 DRRURRDDDR 的顺序通过迷宫， 一共 1010 步。其中 D、U、L、RD、U、L、R 分别表示向下、向上、向左、向右走。 对于下面这个更复杂的迷宫（3030 行 5050 列），请找出一种通过迷宫的方式，其使用的步数最少，在步数最少的前提下，请找出字典序最小的一个作为答案。

请注意在字典序中 D<L<R<UD<L<R<U。

01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000

from queue import Queue
#          D        L        R      U
dirs = [[1, 0], [0, -1], [0, 1], [-1, 0]]
def next_states(_x, _y, row, col):
    res = []
    for (dx, dy) in dirs:
        x, y = _x + dx, _y + dy
        if (0 <= x < row and 0 <= y < col) and (maze[x][y] == '0'):
            res.append((x, y))
    return res
def gen_direction(x1, y1, x2, y2):
    delta_x = x2 - x1
    delta_y = y2 - y1
    if delta_x > 0:
        return 'D'
    if delta_y < 0:
        return 'L'
    if delta_y > 0:
        return 'R'
    if delta_x < 0:
        return 'U'

maze = '''01010101001011001001010110010110100100001000101010
00001000100000101010010000100000001001100110100101
01111011010010001000001101001011100011000000010000
01000000001010100011010000101000001010101011001011
00011111000000101000010010100010100000101100000000
11001000110101000010101100011010011010101011110111
00011011010101001001001010000001000101001110000000
10100000101000100110101010111110011000010000111010
00111000001010100001100010000001000101001100001001
11000110100001110010001001010101010101010001101000
00010000100100000101001010101110100010101010000101
11100100101001001000010000010101010100100100010100
00000010000000101011001111010001100000101010100011
10101010011100001000011000010110011110110100001000
10101010100001101010100101000010100000111011101001
10000000101100010000101100101101001011100000000100
10101001000000010100100001000100000100011110101001
00101001010101101001010100011010101101110000110101
11001010000100001100000010100101000001000111000010
00001000110000110101101000000100101001001000011101
10100101000101000000001110110010110101101010100001
00101000010000110101010000100010001001000100010101
10100001000110010001000010101001010101011111010010
00000100101000000110010100101001000001000000000010
11010000001001110111001001000011101001011011101000
00000110100010001000100000001000011101000000110011
10101000101000100010001111100010101001010000001000
10000010100101001010110000000100101010001011101000
00111100001000010000000110111000000001000000001011
10000001100111010111010001000110111010101101111000'''.split()
row, col = len(maze), len(maze[0])
queue = Queue()

start = (0, 0)
target = (row-1, col-1)

queue.put((0, 0))
pres = {start: start}

while not queue.empty():
    x, y = queue.get()
    if (x, y) == target:
        break
    for (nx, ny) in next_states(x, y, row, col):
        if (nx, ny) not in pres.keys() and maze[nx][ny] == '0':
            queue.put((nx, ny))
            pres[(nx, ny)] = (x, y)

path = []
cur = target
while cur != start:
    path.append(cur)
    cur = pres[cur]
path.append((0, 0))
path = path[::-1]

print(path)

seq = []
for i in range(1, len(path)):
    seq.append(gen_direction(*path[i-1], *path[i]))
print(''.join(seq))

解题思路： 这题思路为bfs（广度优先），代码是引用了神一样的我的代码。其中的思路就是bfs，注意是的是两个函数，一个是方向函数，一个是找下一个0的函数，最后bfs用队列来实现，这种题最好自己动手写一遍代码。

学到的知识点：

def aa(x,y):
  return x+y
path = []
path.append((1,2))
print(aa(*path[0]))#利用*来实现（1，2）坐标的参数代入函数中
## 3

2-蛇形填数

如下图所示，小明用从 11 开始的正整数“蛇形”填充无限大的矩阵。

1 2 6 7 15 …
3 5 8 14 …
4 9 13 …
10 12 …
11 …
…

容易看出矩阵第二行第二列中的数是 55。请你计算矩阵中第 2020 行第 2020 列的数是多少？

print(19*19+20*20)

解题思路： 看出规律来就是，第n行第n列的数等于（n-1）（n-1）+nn

3-迷宫2

X 星球的一处迷宫游乐场建在某个小山坡上。它是由 10 \times 1010×10 相互连通的小房间组成的。

房间的地板上写着一个很大的字母。我们假设玩家是面朝上坡的方向站立，则：

LL 表示走到左边的房间，
RR 表示走到右边的房间，
UU 表示走到上坡方向的房间，
DD 表示走到下坡方向的房间。
X 星球的居民有点懒，不愿意费力思考。他们更喜欢玩运气类的游戏。这个游戏也是如此！

开始的时候，直升机把 100100 名玩家放入一个个小房间内。玩家一定要按照地上的字母移动。

迷宫地图如下：

UDDLUULRUL
UURLLLRRRU
RRUURLDLRD
RUDDDDUUUU
URUDLLRRUU
DURLRLDLRL
ULLURLLRDU
RDLULLRDDD
UUDDUDUDLL
ULRDLUURRR
请你计算一下，最后，有多少玩家会走出迷宫，而不是在里边兜圈子？

tg = []
mm = '''
UDDLUULRUL
UURLLLRRRU
RRUURLDLRD
RUDDDDUUUU
URUDLLRRUU
DURLRLDLRL
ULLURLLRDU
RDLULLRDDD
UUDDUDUDLL
ULRDLUURRR
'''.split()
r = len(mm)
l = len(mm[0])
def check3(i,j):
  if((i,j) in tg):
    return 1
  else:
    return 0
def check(x, i, j):
  del1 = 0
  del2 = 0
  if (x == 'D'):
      del1 = 1
  if (x == 'L'):
      del2 = -1
  if (x == 'R'):
      del2 = 1
  if (x == 'U'):
      del1 = -1
  i = i + del1
  j = j + del2
  if (i >=r or i < 0 or j >=l or j < 0 or check3(i, j) == 1):
    return 1
  elif((i,j) in tt):
    return 0
  else:
    tt.append((i,j))
    return check(mm[i][j],i,j)
sum = 0
for i in range(r):
  for j in range(l):
    tt = []
    if(check(mm[i][j],i,j)==1):
      sum = sum +1
print(sum)

解题思路： 这题就是dfs，不用多讲，就是利用函数递归,从一个字符遍历到它出去为止或遇到重复的位置时return。我在题解里看到更好看的代码如下：

#深度dfs递归
map = ['UDDLUULRUL',
       'UURLLLRRRU',
       'RRUURLDLRD',
       'RUDDDDUUUU',
       'URUDLLRRUU',
       'DURLRLDLRL',
       'ULLURLLRDU',
       'RDLULLRDDD',
       'UUDDUDUDLL',
       'ULRDLUURRR']#这里字符串元素要用单引号括起，用双引号，后面会提示数组越界
count = 0
tablist = [[0] * 10 for i in range(10)]


def find(x, y):
    if x < 0 or x > 9 or y < 0 or y > 9:  # 走出迷宫
        global count
        count += 1
        return True

    if tablist[x][y] == 1:  # 已走过
        return False

    tablist[x][y] = 1  # 若之前没走过，则标记走过

    if map[x][y] == "U":
        find(x - 1, y)#递归
    elif map[x][y] == "D":
        find(x + 1, y)
    elif map[x][y] == "L":
        find(x, y - 1)
    elif map[x][y] == "R":
        find(x, y + 1)
    return False


for i in list(range(10)):
    for j in list(range(10)):
        tablist = [[0] * 10 for i in range(10)]#遍历每个坐标起点开始前都先清零
        find(i, j)

print(count)

（niu的代码）