| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
My solution 57636356 to the problem 839C - Journey uses BFS implementation but I am getting a wrong answer on test no.4. Editorial suggests a dfs implementation which is clear enough but I want to know what went wrong in my implementation? Any ideas or sample testcases would be a great help.
Thanks in advance!!
Your probability calculation at line '' double ff = 1.0/sz(v[y]); '' is wrong. Here for a node not leaf, you are including its parent also, which reduces the probability of its children. Just change it to the probability of its children and your solution will be accepted. Check : 57641710 Sample test:
6 1 2 1 3 3 4 2 5 2 6Yes, I got it.Thanks again!