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:T4f9,#include #define int long long using namespace std; struct move_p { int a; double p, prev_dp; }; struct edge { int a, b, s, t; double p; void read() { cin >> a >> b >> s >> t >> p; } }; map, greater> moves; double dp[1000000]; void apply_moves_after(int time) { while(moves.size() && moves.begin()->first > time) { auto &v = moves.begin()->second; map nxt_dp; for(auto [a, p, prev_dp]: v) { double on_try = p * prev_dp + (1 - p) * dp[a]; nxt_dp[a] = max(nxt_dp[a], on_try); } for(auto [a, p]: nxt_dp) { dp[a] = max(dp[a], p); } moves.erase(moves.begin()); } } int32_t main() { cin.tie(0)->sync_with_stdio(0); int M, N, K; cin >> M >> N >> K; vector edges(M); for(auto &e: edges) { e.read(); } sort(edges.begin(), edges.end(), [](edge a, edge b) { return a.t > b.t; }); dp[1] = 1; for(auto &[a, b, s, t, p]: edges) { if(t > K) { continue; } apply_moves_after(t); moves[s].push_back({a, p, dp[b]}); } apply_moves_after(-1); cout << fixed << setprecision(6) << dp[0]; } 5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":"page.tsx","children":[["$","div",null,{"className":"w-full","childre

코드 #6084