class Solution {
public:
int maximalPathQuality(vector<int>& values, vector<vector<int>>& edges, int maxTime) {
int n = values.size();
vector<vector<pair<int,int>>> g(n);
//建图
for(auto& e : edges)
{
auto x = e[0], y = e[1], z = e[2];
g[x].emplace_back(y,z);
g[y].emplace_back(x,z);
}
//dijkstra
priority_queue<pair<int,int>, vector<pair<int,int>> ,greater<pair<int,int>> > q;
vector<int> dis(n,INT_MAX);
dis[0] = 0;
q.emplace(0,0);
while(q.size())
{
auto [dx,x] = q.top();
q.pop();
if(dx > dis[x])continue;
for(auto [y,t] : g[x])
{
int new_dix = dx + t;
if(new_dix < dis[y])
{
dis[y] = new_dix;
q.emplace(new_dix,y);
}
}
}
int ans = values[0];
vector<bool> vis(n);
function<void(int,int,int)> dfs = [&](int u, int sum_time, int sum_val)
{
if(u == 0)
{
ans = max(ans,sum_val);
}
for(auto [y,z] : g[u])
{
if(sum_time + z + dis[y] > maxTime)continue;
if(vis[y])dfs(y, sum_time + z, sum_val);
else
{
vis[y] = true;
dfs(y, sum_time + z, sum_val + values[y]);
vis[y] = false;
}
}
};
dfs(0, 0, 0);
return ans;
return 1;
}
};
emplace()和push_back()区别,emplace是直接创建泛型对象
例如:
vector<pair<int,int>> v;
v.push_back(make_pair(1,2));
v.emplace_back(3,4);