|
|
Can anyone please describe the test case? How can it be as low as 0.66667? - First night one good senator dies. We have 2 good senators and 1 spy.
- First day senators choose to kill 2 people. They have a 66.6% chance that they get the spy and a good guy remains, 33.3% chance that the spy lives. I use the dp to solve this problem. but always wa #2.
who can help me?
where i need to pay attention？ Yes, it is the dp. I also get wa #2, but in my case WA means runtime error. After fixing this bug(IndexOutOfRangeException) i get AC. If K > N - K, how can every spy kill exactly one non-spy? |
|
|
