Grammy and Jewelry
已经菜到连完全背包都没看出来了,都已经想到最短路求出费用,然后开始硬贪心。最开始则是想到要DP但是没想到用最短路,还想直接在图上DP,然后就跳题了。
#include <iostream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <queue>
#include <vector>
#include <cstdio>
#include <set>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <map>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define reps(i, a, b) for (int i = a; i >= b; i--)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a*b/gcd(a,b)
#define ls(node) tree[node].ls
#define rs(node) tree[node].rs
#define val(node) tree[node].val
using namespace std;
const int N = 1e6+ 7;
const int M = 50+7;
const int inf = 0x3f3f3f3f;
const int mod = 998244353;
typedef long long ll;
struct edge
{
ll to,cost;
edge(int _to,int _cost):to(_to),cost(_cost) {}
};
typedef pair<ll,ll> P;
vector<edge> G[N];
ll d[N];
void dj(int s)
{
priority_queue<P,vector<P>,greater<P> > que;
memset(d,inf,sizeof d);
d[s]=0;
que.push(P(0,s));
while(!que.empty())
{
P p = que.top();
que.pop();
ll v = p.second;
if (d[v] < p.first)
continue;
for(int i = 0; i < G[v].size(); i++)
{
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost)
{
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
void add(int u,int v,int w=1)
{
G[u].push_back(edge(v,w));
}
ll a[N];
ll dp[N];
int main()
{
int n,m,k;
scanf("%d%d%d",&n,&m,&k);
rep(i,2,n)
scanf("%lld",&a[i]);
rep(i,1,m){
int u,v;
scanf("%d%d",&u,&v);
add(u,v);
add(v,u);
}
dj(1);
for(int i=2;i<=n;i++){
for(int j=0;j<=k;j++){
if(j>=2*d[i])
dp[j]=max(dp[j],dp[j-2*d[i]]+a[i]);
}
}
rep(i,1,k)
printf("%lld ",dp[i]);
return 0;
}