本题用dij来做,那个等级的约束注意一下就行了
#include<iostream>
#include<cstdio>
#include<stack>
#include<algorithm>
using namespace std;
const int maxn=100+10;
const int INF=1e8;
int v[maxn][maxn],dis[maxn],vis[maxn];
struct node{
int price,level,alter;
}p[maxn];
int n;
void dij(int x)
{
for(int i=1;i<=n;i++)
{
dis[i]=p[i].price;
//cout<<dis[i]<<endl;
}
for(int i=1;i<n;i++)
{
int sum=INF,u=-1;
for(int j=1;j<=n;j++)
{
if((dis[j]<=sum)&&(!vis[j]))
{
sum=dis[j];u=j;
}
}
vis[u]=1;
//cout<<sum<<endl;
for(int j=1;j<=n;j++)
if(!vis[j]&&dis[j]>dis[u]+v[j][u])
{
dis[j]=dis[u]+v[j][u];
//cout<<dis[j]<<endl;
}
}
}
void init()
{
for(int i=0;i<=n;i++)
{
for(int j=0;j<=n;j++)
v[i][j]=i==j?0:INF;
}
}
int main()
{
int level,x,y;
//freopen("M.txt","r",stdin);
scanf("%d %d",&level,&n);
init();
for(int i=1;i<=n;i++)
{
scanf("%d %d %d",&p[i].price,&p[i].level,&p[i].alter);
for(int j=1;j<=p[i].alter;j++)
{
scanf("%d %d",&x,&y);
//cout<<x<<y<<endl;
v[i][x]=y;
}
}
int ans=INF;
for(int i=1;i<=n;i++)
{
int minlevel=p[i].level;
for(int j=1;j<=n;j++)
{
if(p[j].level-minlevel>level||minlevel>p[j].level) vis[j]=1;
else vis[j]=0;
}
dij(1);
ans=min(ans,dis[1]);
}
printf("%d\n",ans);
return 0;
}