| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
how to solve this SPOJ problem ? Is my way correct?
Spoj... You are given a acyclic directed graph with each edge having probability of success. You are also given two nodes start and end !
What is the maximum probability to reach from starting point to End.?
What I am trying is :
1) Remove redundant edges with same source and destination and put the edge with maximum probability instead. 2) Topological Sort the Graph. 3) Calculate the probability starting from S.
I am only getting 50 points . Am I wrong somehwere?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
realloc_anh1l1ator | 2015-08-15 11:40:26 | 579 | Initial revision (published) |
