L3-007 天梯地图 (30 point(s))
两次spfa+两次dfs通过邻接链表存边，求最短时间时相等时间求最短长度，直接存边的下标再进行判断#include<iostream>#include<cstring>#include<queue>#include<vector>#include<algorithm>using namespace std;const int N = 510 , M = N*
