# 跃迁引擎启动

rank solved A B C D E F G H I J K L M
10 11 O O O Ø O . . O O O O O O

Solved by Henry.

Solved by XLor.

Solved by Henry.

# D

UpSolved by XLor.

# E

Solved by XLor.

$m$ 个关键点一起 $bfs$，每个点维护一下最短距离和多少个关键点能够以最短距离到达该点，转移时分从未访问过和最短距离相同，若出现一个点次数为关键点个数，即为答案。

# H

Solved by Forsaken.

Solved by Henry.

# J

Solved by Forsaken.

# K

Solved by Forsaken.

Solved by XLor.

Solved by XLor.