Description

Input

Output

Sample Input

1 4
10000 3 2
2 8000
3 5000
1000 2 1
4 200
3000 2 1
4 200
50 2 0

Sample Output

5250

Source

//这道是中文题,我居然还理解错了题意.本题的等级差是指  : 最高等级与最低等级的差值,并非每两个人之间的差值.

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <vector>
#define ll long long
#define inf 0x3f3f3f3fusing namespace std;
int n,m;
struct node{int p;int l;int x;
}a[110];
struct Nd{int num;int money;
}now;
int s,e;
vector<Nd>vec[110];
int vis[110];
int dis[110];
int ans;
void spfa(){memset(vis,0,sizeof(vis));memset(dis,inf,sizeof(dis));queue<int>q;q.push(1);vis[1] = 1;dis[1] = a[1].p;while(!q.empty()){int u = q.front();q.pop();vis[u] = 0;for(int i = 0; i < vec[u].size(); ++i){now = vec[u][i];if(dis[now.num] > dis[u]-a[u].p+a[now.num].p+now.money&&a[now.num].l>=s && a[now.num].l<=e){dis[now.num] = dis[u]-a[u].p+a[now.num].p+now.money;if(!vis[now.num]){vis[now.num] = 1;q.push(now.num);}}}}for(int i = 1; i <= n; ++i){ans = min(ans,dis[i]);}
}
int main()
{while(~scanf("%d%d",&m,&n)){for(int i = 0; i <= n; ++i){vec[i].clear();}for(int i = 1; i <= n; ++i){scanf("%d%d%d",&a[i].p,&a[i].l,&a[i].x);for(int j = 0; j < a[i].x; ++j){scanf("%d%d",&now.num,&now.money);vec[i].push_back(now);}}ans = inf;for(int i = a[1].l-m; i <= a[1].l; ++i){s = i;e = i+m;spfa();}printf("%d\n",ans);}return 0;
}

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#define INF 200000000using namespace std;struct node
{int u,v,w;
} edge[10000];
int num=0;
int N,M;
int P[2000],L[2000],n[2000];
int t,v;
int low[2000],a,b;
int has[2000] ;
int Bellman(int u0)
{for(int i=0; i<=N; i++)low[i]=INF;low[u0]=0;for(int i=0; i<N-1; i++){int flag=0;for(int j=0; j<num; j++){if(has[edge[j].u]&&has[edge[j].v]&&low[edge[j].u]+edge[j].w<low[edge[j].v]){low[edge[j].v]=low[edge[j].u]+edge[j].w;flag=1;}}if(flag==0)break;}int Min=INF;for(int i=1; i<=N; i++){low[i]+=P[i];        //最小价格为优惠价+拥有优惠价须要花多少钱if(Min>low[i])Min=low[i];}//printf("%d\n",Min);return Min;
}
int main()
{//freopen("in.txt","r",stdin);while(~scanf("%d%d",&M,&N)){num=0;for(int i=1; i<=N; i++){scanf("%d%d%d",&P[i],&L[i],&n[i]);for(int j=1; j<=n[i]; j++){int a,b;scanf("%d%d",&a,&b);edge[num].u=i;edge[num].v=a;edge[num++].w=b;       //存入优惠的价格}}int ans=L[1];int Min=INF;//最高等级的与最低的等级差不会超过Mfor(int i=0; i<=M; i++){memset(has,0,sizeof(has));for(int j=1; j<=N; j++){if(ans-L[j]<=M-i&&L[j]-ans<=i){has[j]=1;}}int k=Bellman(1);if(Min>k)Min=k;}printf("%d\n",Min);        }
}