牛客小白月赛16 J-小雨坐地铁(建图+最短路)

最新推荐文章于 2022-09-02 22:27:57 发布

liexss

最新推荐文章于 2022-09-02 22:27:57 发布

阅读量204

点赞数

本文链接：https://blog.csdn.net/liexss/article/details/95775997

版权

传送门:QAQ

题意：存在n个站台，m条地铁线，进入每条地铁线都有费用，每条地铁线的乘车费用也不相同，问你从起点站到终点站要最少花多少钱。

思路:暴力建图的复杂度肯定不对，所以在这里我们对每个站都建立一个虚点，建立虚点到每条地铁线的边，然后在建立每条地铁线的分层图就可以将整个图建立完全，然后跑遍最短路即可。

附上代码:

#include<cstdio>                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                      
#include<vector>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<algorithm>
using namespace std;
#define pi acos(-1.0)
#define inf 0x3f3f3f3f
int head[3100000];
struct inst {
	int v;
	int w;
	int next;
};
struct edd {
	int v;
	int w;
	edd() {
	}
	edd(int vv, int ww) {
		this->v = vv;
		this->w = ww;
	}
	bool operator <(const edd A) const {
		return this->w > A.w;
	}
};
inst edge[3000000];
int cnt = 0;
int n, m, s, e;
void addedge(int x, int v, int w) {
	edge[cnt].v = v;
	edge[cnt].w = w;
	edge[cnt].next = head[x];
	head[x] = cnt++;
}
int dis[3100000];
int vis[3100000];
void dijskra() {
	for (int i = 0; i <=n; i++) {
		dis[i] = inf;
	}
	dis[s] = 0;
	memset(vis, 0, sizeof(vis));
	priority_queue<edd>q;
	q.push(edd(s, 0));
	while (!q.empty()) {
		edd aa = q.top();
		q.pop();
		if (vis[aa.v]) continue;
		vis[aa.v] = 1;
		for (int i = head[aa.v]; i != -1; i = edge[i].next) {
			if (dis[edge[i].v] > dis[aa.v] + edge[i].w&&!vis[edge[i].v]) {
				dis[edge[i].v] = dis[aa.v] + edge[i].w;
				q.push(edd(edge[i].v, dis[edge[i].v]));
			}
		}
	}
}
int main(void) {
	scanf("%d%d%d%d", &n, &m, &s, &e);
	memset(head, -1, sizeof(head));
	for (int i = 1; i <= m; i++) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		for (int z = 1; z <= c; z++) {
			int x;
			scanf("%d", &x);
			addedge(n + z, x, 0);
			addedge(x, n + z, a);
		}
		for (int z = 1; z < c; z++) {
			addedge(n + z, n + z + 1, b);
			addedge(n + z + 1, n + z, b);
		}
		n += c;
	}
	dijskra();
	if (dis[e] == inf) printf("-1\n");
	else printf("%d\n", dis[e]);
}