1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T61c,#include using namespace std; const int MX = 201; double dp[MX][2]; struct edge { int u, prob, dist; }; struct elem { int u, t; double dist; bool operator<(const elem& rhs) const { return dist > rhs.dist; } }; void solve() { int n, m, start, end, s, p, y; cin >> n >> m >> start >> end >> s >> p >> y; vector> adj; adj.resize(n+1); while(m--) { int u, v, prob, dist; cin >> u >> v >> prob >> dist; adj[u].push_back({v, prob, dist}); adj[v].push_back({u, prob, dist}); } for(int i = 0; i < MX; i++) { dp[i][0] = dp[i][1] = 1e18; } priority_queue pq; dp[start][1] = 0; pq.push({start, 1, 0}); while(pq.size()) { auto [u, t, dist] = pq.top(); pq.pop(); if(dp[u][t] < dist) continue; for(auto [v, prob, dist_edge] : adj[u]) { // buy ticket double val = dp[u][t] + (t ? s : 0) + p * dist_edge; if(val < dp[v][0]) { dp[v][0] = val; pq.push({v, 0, val}); } // not buy ticket val = dp[u][t] + prob / 100.0 * (y + p * dist_edge); if(val < dp[v][1]) { dp[v][1] = val; pq.push({v, 1, val}); } } } double ans = min(dp[end][0], dp[end][1]); cout << fixed << setprecision(2) << ans << '\n'; } int32_t main()

코드 #3962