The Shortest Path in Nya Graph HDU - 4725
思路:裸的最短路,中间多了个层级的概念,每个层级到他上一个层级与下一个层级距离都是C,假设一共n个点,我们可以用n+1、n+2…储存层级,每个点到所属层级距离为0
具体代码如下
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#define x first
#define y second
using namespace std;
typedef pair<int, int> PII;
const int N = 200010, M = 1000010;
int n, m, c;
int h[N], e[M], w[M], ne[M], idx;
int dis[N];
bool st[N];
void add(int a, int b, int c){
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
void dijkstra(){
memset(dis, 0x3f, sizeof dis);
memset(st, 0, sizeof st);
priority_queue<PII, vector<PII>, greater<PII> >heap;
dis[1] = 0;
heap.push({0, 1});
while(heap.size()){
PII t = heap.top();
heap.pop();
int ver = t.y;
if(st[ver]) continue;
st[ver] = true;
for(int i=h[ver]; ~i; i=ne[i]){
int j = e[i];
if(dis[j] > dis[ver] + w[i]){
dis[j] = dis[ver] + w[i];
heap.push({dis[j], j});
}
}
}
}
int main(){
int T, kase = 0;
scanf("%d", &T);
while(T--){
memset(h, -1, sizeof h);
idx = 0;
scanf("%d%d%d", &n, &m, &c);
for(int i=1; i<=n; ++i){
int l;
scanf("%d", &l);
add(l+n, i, 0);
if(l-1 >= 1) add(i, l-1+n, c), add(l-1+n, i, c);//层数大于1就与它下面的一个层数连边
if(l+1 <= n) add(i, l+1+n, c), add(l+1+n, i, c);//层数小于n就与它上面的一个层数连边
}
for(int i=0; i<m; ++i){
int a, b, w;
scanf("%d%d%d", &a, &b, &w);
add(a, b, w);
add(b, a, w);
}
dijkstra();
if(dis[n] == 0x3f3f3f3f) printf("Case #%d: -1\n", ++kase);
else printf("Case #%d: %d\n", ++kase, dis[n]);
}
return 0;
}