题目大意:给出等级M,点的个数N,以及N个点与K个点的边,求在满足等级差的前提下到1所需的最短路
解题思路:1.多了一个M限制,在可取的最小与最大等级之间dijkstra即可
2.增加一个源点0,0到其他点的距离初始化每个点的价值
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <list>
#include <set>
using namespace std;
const int INF = 0xffffff;
int M,N,dengji[110];
int dis[110],mp[110][110];
bool vis[110];
void dijkstra(int m,int n)//可以交易的最小等级为m,最大等级为n
{
int num = 1;
int minn;
memset(vis,0,sizeof(vis));
for(int i = 0; i <= n; i++)
dis[i] = INF;
vis[0] = 1;
dis[0] = 0;
for(int i = 1;i <= N; i++)
if(dengji[i] >= m && dengji[i] <= n)//初始化dis,若第i个点的等级符合要求
dis[i]=mp[0][i];
int k = 0;//记录最后被更新的点
while(1)
{
minn = INF;
for(int i = 0; i <= N; i++)
if(dengji[i]>=m && dengji[i]<=n && !vis[i] && minn>dis[i])
{
minn = dis[i];
k = i;
}
vis[k]=1;
if(k == 1)//1点的最小值不能再被更新
return;
for(int i = 0; i <= N; i++)//更新
if(dengji[i]>=m && dengji[i]<=n && !vis[i] && dis[i]>dis[k]+mp[k][i])
{
dis[i]=dis[k]+mp[k][i];
}
}
}
int main()
{
int k,t,p;
cin>>M>>N;
for(int i = 0; i <= N; i++)
{
for(int j = 0; j <= N; j++)
{
mp[i][j] = INF;
}
}
int ans = INF;
for(int i = 1; i <= N; i++)
{
scanf("%d%d%d",&mp[0][i],&dengji[i],&k);//0是增加的原点
for(int j = 1; j <= k; j++)
{
scanf("%d%d",&t,&p);
mp[t][i]=p;
}
}
for(int i = dengji[1]-M; i <= dengji[1]; i++)
{
dijkstra(i,i+M);
if(ans > dis[1])
ans = dis[1];
}
cout<<ans<<endl;
return 0;
}