|
|
| Show all threads Hide all threads Show all messages Hide all messages | | a little hint | LeTim | 1952. To Kill the Dragon | 14 Oct 2024 19:48 | 1 | use dynamic programming by subsets, one mask in DP state for one breath in a row and two masks in DP state for two breaths in a row, time complexity ~O(k * (n+m)^2 * 4^(n+m)) | | How to distribute safe places for mages properly and effectively on python | MikhailOrlov | 1952. To Kill the Dragon | 26 Jun 2022 21:36 | 1 | Is there any mathematical algorithm or i need to check every way mages can go | | illegal test data | Shen Yang | 1952. To Kill the Dragon | 22 Nov 2016 06:23 | 4 | problem description said dragon will not use breath two times, but test 21 there is at least three breath in the input file...
hope admin can fix it.. oops I misunderstood "in a row"
is "in a row" means cosecutive?? I think we must use O(2^20*10) dynamic programming ,because there maybe two breath in a row
brute_force will definitely got TLE | | Any hint when there is no healers | panyong0202 | 1952. To Kill the Dragon | 20 Jan 2015 15:18 | 2 | Oh, there are no such cases. There is at least one healer and one attacker.
Fixed in statement now. | | Please, reduce the condition | Saligzhanov_KB_13 | 1952. To Kill the Dragon | 14 Dec 2013 13:14 | 2 | tl;dr
And only one guy could solve this :D Each sentence in problem statement makes sense, it can't be reduced.
There are three author solutions, but two other guys didn't submit them.
BTW, I don't think that this problem so difficult, try to solve it.
P.S. "Условие задачи" = "Problem statement", "condition" - условие, которое может быть истинным или ложным
Edited by author 14.12.2013 18:41 |
|
|
|
