题目大意:给定n个顶点,m条边,时间t,然后每个顶点都有无限多的宝石,宝石的价值为a[i],然后每去一条边消耗的时间为1,从顶点1出发,要把宝石带回顶点才算获得该价值,问在t的时间里面,能获得的最大价值是多少?
最短路+完全背包
最短路用Dijkstra的板子,浅浅改一下就行了
ac代码:
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 5e5+10;
const int inf = 0x3f3f3f3f;
int dp[maxn];
struct node{
int to,w;
};
int m,n,s;
int t;
int a[maxn];
vector<node>g[maxn];
int dis[maxn];
bool vis[maxn];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
void Dijkstra(){
for(int i=1;i<=n;i++){
vis[i]=false;
dis[i]=inf;
}
dis[1]=0;//顶点默认是1
q.push(make_pair(dis[1],1));
while(!q.empty()){
pair<int,int> now =q.top();
q.pop();
if(vis[now.second]) continue;
vis[now.second]=true;//如果已经被访问过了就continue因为是优先队列,所以保证了先访问的一定是最短的,即已经求出了到某点的最短路径,队列剩下的都不是最短的了,continue即可
for(int i=0;i<g[now.second].size();i++){
//now.second->g[now.second][i].to
int to=g[now.second][i].to;
int w=g[now.second][i].w;
if(dis[to]>dis[now.second]+w){
dis[to]=dis[now.second]+w;
q.push(make_pair(dis[to],to));
}
}
}
}
int main(void) {
scanf("%d%d%d",&n,&m,&t);
for (int i = 2; i <= n ; ++i) scanf("%d", &a[i]);
for(int i=1;i<=m;++i){
int u,v,w;
scanf("%d%d",&u,&v);
if (u == v) continue;
g[u].push_back({v,2});//因为是来回,边权是2
g[v].push_back({u,2});//这是无向图
}
Dijkstra();
//for(int i=1;i<=n;i++) printf("%d ",dis[i]);
//下面就是完全背包问题
for (int i = 1; i <= n; ++i) {
for (int j = dis[i]; j <= t; ++j) {
dp[j] = max(dp[j], dp[j - dis[i]] + a[i]);
}
}
for (int i = 1; i <= t; ++i) {
cout << dp[i] << " ";
}
return 0;
}
下面是DIjkstra的板子
//Dijkstra的板子
#include <stdio.h>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 5e5+10;
const int inf = 0x3f3f3f3f;
struct node{
int to,w;
};
int m,n,s;
vector<node>g[maxn];
int dis[maxn];
bool vis[maxn];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>q;
void Dijkstra(){
for(int i=1;i<=n;i++){
vis[i]=false;
dis[i]=inf;
}
dis[s]=0;
q.push(make_pair(dis[s],s));
while(!q.empty()){
pair<int,int> now =q.top();
q.pop();
if(vis[now.second]) continue;
vis[now.second]=true;//如果已经被访问过了就continue因为是优先队列,所以保证了先访问的一定是最短的,即已经求出了到某点的最短路径,队列剩下的都不是最短的了,continue即可
for(int i=0;i<g[now.second].size();i++){
//now.second->g[now.second][i].to
int to=g[now.second][i].to;
int w=g[now.second][i].w;
if(dis[to]>dis[now.second]+w){
dis[to]=dis[now.second]+w;
q.push(make_pair(dis[to],to));
}
}
}
}
int main(void) {
scanf("%d%d%d",&n,&m,&s);//代表有n个顶点,m条边,问从s到每个顶点的最短路
for(int i=1;i<=m;++i){
int u,v,w;
scanf("%d%d%d",&u,&v,&w);//从u到v的距离是w
g[u].push_back((node){v,w});
}
Dijkstra();
for(int i=1;i<=n;i++) printf("%d ",dis[i]);
return 0;
}