A. Environment-Friendly Travel最短路

这题会比普通的最短路多几个变量，也多了几个要处理的边界条件，所以搞起来也会麻烦一点，要有耐心哦

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e3+7;
typedef pair<int,int>PII;
//vector<PII>v[N];
vector<PII>v[N];
int Max=0x3f3f3f3f;
int Min=-0x3f3f3f3f;
int x[N],y[N];
bool vis[N][N];
int dmax;
//int cc[N];
int n;
int co[N][N];
int mod[N];
int get(int i,int j)
{
	return ceil(sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])));
}
struct Node
{
	int c,d,u;
	bool operator <(const Node&pdx)const
	{
		if(c==pdx.c)
		return d>pdx.d;
		return c>pdx.c;
	}
};
void dijkstra()
{
	priority_queue<Node>q;
	co[n][0]=0;
	q.push({0,0,n});
	while(!q.empty())
	{
		Node t=q.top();
		int t1=t.c,t2=t.d,t3=t.u;
		q.pop();
		if(vis[t3][t2])
		continue;
		vis[t3][t2]=1;
		for(int i=0;i<v[t3].size();i++)
		{			
			int dd=get(t3,v[t3][i].first);
			int ww=dd*mod[v[t3][i].second];
			if(t2+dd>dmax)
			continue;
			if(co[v[t3][i].first][t2+dd]>co[t3][t2]+ww)
			{
				co[v[t3][i].first][t2+dd]=co[t3][t2]+ww;
				q.push({co[v[t3][i].first][t2+dd],t2+dd,v[t3][i].first});
			}
		}
	}
}
int main()
{
	int ttx,tty,kkx,kky;
	cin>>ttx>>tty>>kkx>>kky;
	cin>>dmax>>mod[0];
	int ttk;
	cin>>ttk;
	for(int i=1;i<=ttk;i++)
	cin>>mod[i];
	int m;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>x[i]>>y[i]>>m;
		while(m--)
		{
			int j,k;
			cin>>j>>k;
			v[i].push_back({j,k});
			v[j].push_back({i,k});			
		}
		v[i].push_back({n+1,0});
		v[n].push_back({i,0});		
	}
	v[n].push_back({n+1,0});
	x[n]=ttx,y[n]=tty;
	x[n+1]=kkx,y[n+1]=kky;
	if(get(n,n+1)>dmax)
	{
		cout<<"-1"<<endl;
		return 0;
	}
	memset(co,0x3f3f3f,sizeof(co));
	dijkstra();
	int ans=0x3f3f3f3f;
	for(int i=0;i<=dmax;i++)
	{
		ans=min(ans,co[n+1][i]);
	}
	cout<<ans<<endl;
	return 0;
}

虽然说题目复杂一点但实际上还是dijkstra堆优化算法，在node结构体里面重载<用于优先队列的排序，然后就常规的跑dijkstra，注意要存储co2和距离两个变量。