注意建图,并且用优先队列;
题意:每个点都位于某一层
第k层的点可花费 C 走到 k+1 或 k-1 层上的点
(G++不会TLE)
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long LL;
const int MAXN = 302020;
const int MAXM = 1602020;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
const double eps = 1e-4;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
struct qnode
{
int v;
int c;
qnode(int _v=0,int _c=0):v(_v),c(_c){}
bool operator <(const qnode &r)const
{
return c>r.c;
}
};
struct Edge
{
int v,cost;
Edge(int _v=0,int _cost=0):v(_v),cost(_cost){}
};
vector<Edge>E[MAXN];
bool vis[MAXN];
int dist[MAXN];
void Dijkstra(int n,int start)//点的编号从1开始
{
memset(vis,false,sizeof(vis));
for(int i=1;i<=n;i++)dist[i]=INF;
priority_queue<qnode>que;
while(!que.empty())que.pop();
dist[start]=0;
que.push(qnode(start,0));
qnode tmp;
while(!que.empty())
{
tmp=que.top();
que.pop();
int u=tmp.v;
if(vis[u])continue;
vis[u]=true;
for(int i=0;i<E[u].size();i++)
{
int v=E[tmp.v][i].v;
int cost=E[u][i].cost;
if(!vis[v]&&dist[v]>dist[u]+cost)
{
dist[v]=dist[u]+cost;
que.push(qnode(v,dist[v]));
}
}
}
}
void addedge(int u,int v,int w)
{
E[u].push_back(Edge(v,w));
}
int main()
{
int t,u,v,cost,n,m,c,d,cas=1;
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
scanf("%d",&t);
while(t--)
{
scanf("%d%d%d",&n,&m,&c);
for(int i = 1;i <= 3*n;i++) E[i].clear();
for(int i=1;i<n;i++)
{
addedge(n+i,n*2+i+1,c);
addedge(n+i+1,n*2+i,c);
}
for(int i=1;i<=n;i++)
{
scanf("%d",&d);
addedge(i,n+d,0);
addedge(n*2+d,i,0);
}
for(int i=0;i<m;i++)
{
scanf("%d%d%d",&u,&v,&cost);
addedge(u,v,cost);
addedge(v,u,cost);
}
Dijkstra(3*n,1);
int ans=0;
if(dist[n]==INF) ans=-1;
else ans=dist[n];
printf("Case #%d: %d\n",cas++,ans);
}
return 0;
}