Dijkstra求单源最短路
const int N = 1e5+5;
const int M = 2e5+5;
const int inf = 0x3f3f3f3f;
int dis[N], head[N];
bool inq[N];
i
2022-04-01