地图与游戏内地图呈对应关系，如图所示 | This map aligns to the in-game map like this:

比如传送方格的坐标为A5
e.g., the teleporter lies on tile A5


格与格之间用一条线连接起来代表双向互通（类似其他的普通地图方块）；比如F5与G5即为双向互通。
A dash means two tiles are connected and the two tiles/entrances/exits act like the normal ones just like the ones in the other areas of the map; e.g., F5 and G5 are connected.

格子内侧紧贴的坐标代表从该格向坐标方向出口的目的地；比如G3向左侧移动则会前往F2格右侧、F2向右侧移动则会前往B2左侧。
The coordinate written on the inside of the tile means where we will go if we exit on that side of the tile; e.g., exiting G3 from the left will lead us to the right side of F2, exiting F2 from the right will lead us to the left side of B2.

蓝色弧线代表单向通道；比如从F1左侧口可以前往F1右侧口，但是从F1右侧则无法前往F1左侧口
A blue curve means a one-way passage; e.g., you can reach the right exit from the left exit of F1, but you cannot reach the left exit from the right exit of F1.

红色弧线代表“死路”；比如从D2右上口出去可以前往E2左上口，但是处于E2左上的时候无法抵达任何E2其他的出入口，只能折返回D2右上口。死路有时并不是字面意义的死路；比如F3-C3-D3：从F3左侧出去，将会到达C3右侧，但是是死路，但是从C3右侧出去，将会到达D3左侧。
A red curve means a dead end; e.g., you can reach the top-left of E2 from the top-right of D2, but you cannot reach any other E2 entrances/exits at the top-left of E2, and can only return back to the top-right of D2. A dead end is not really a literal dead end in some way; e.g., F3-C3-D3: Exit F3 from the left, we will reach the right of C3, exit C3 from the right, we will reach the left of D3.

如何从A5到达F2？
How to get to F2 from A5?

从F2开始逆推：哪些方格可以到达F2？
We begin from the destination, F2: from which tiles can we reach F2?
全图提及F2的方格有：A3，B2，G3，F1，F3（双向互通）
Look for F2 throughout the map: A3，B2，G3，F1，F3（connected）

1
哪些方格可以到达A3？
From which tiles can we reach A3?
D3*（只能从左/上到达）
D3*(only reachable when entering from the left/top)

2
哪些方格可以到达B2？
From which tiles can we reach B2?
C1，D3，F2

3
...G3?
A2

4
...F1?
E1（双向互通|connected）

5
F3?
F2（双向互通|connected）

1.1
D3?
B3（下出去，上到达，符合1.1要求|departs from the bottom, arrives at the top, aligns with the restrictions from 1）, C3*（右出去，左到达，符合要求；只能从右侧到达|departs from the right, arrives at the left, aligns with the restrictions from 1; only reachable when entering from the right）, E3
D2不行，因为上出去，下到达，不符合1要求
D2 does not work since it departs from the top, arrives at the bottom, which does not align with the restrictions from 1.

2.1
C1?
B1*, C2, D1*, D4

2.2
D3?
B3, C3

2.3
F2?
我们可以不考虑这条路径，因为1.5中已经可以到达F2。
We can skip this route since we already mentioned F2 in 1.5.

3.1
A2?
A5, D2*, F2

至此，由于可从A5到达A2到达G3到达F2，所以可行的路径之一为A5-A2-G3-F2
Since we can reach A2 from A5, G3 from A2, F2 from G3, one possible route would be A5-A2-G3-F2.

---

实际计算时可适当跳过要求较多的方格
We can skip some of the tiles that have restrictions for easier calculation.

使用任意编程语言实现自动计算路径（20分）
Using any programming language, write code to calculate paths automatically (20 pts)