| Show all threads Hide all threads Show all messages Hide all messages |
| if U HABE PROBLEM 69 | 👑TIMOFEY👑 | 1643. Attack of the Dark Fortress | 2 Nov 2022 15:39 | 1 |
I tested for a long time and tried to understand why the thymus mockingly shows me such a mocking number, it's all because of the portals, it's just impossible there, I got so confused in them that I didn't understand how my code worked, in general, how to avoid such a problem. add all sorts of checks near the portals, which is right wherever there are portals, just destroy these portals completely, absolutely |
| WA29 | popolwooh | 1643. Attack of the Dark Fortress | 8 Oct 2022 13:41 | 3 |
WA29 popolwooh 6 Aug 2015 16:04 Try this test (if you look neighbour cells in order from -1 left -1 up (11 oclock) clockwise)
4 4
#A#.
#A!.
##.#
.*$. This test also helps with WA3 3 6
!AB#B*
#####.
$.....
out: 6 |
| WA35 | andreyDagger | 1643. Attack of the Dark Fortress | 2 Jan 2022 21:24 | 1 |
WA35 andreyDagger 2 Jan 2022 21:24 There can be more than one portal of same type |
| If you have WA2 | s_shshsh | 1643. Attack of the Dark Fortress | 28 Dec 2021 23:39 | 1 |
"Impossible" should start with uppercase 'I' |
| If you have WA 76 | Aleksandr Derevyagin | 1643. Attack of the Dark Fortress | 28 Sep 2020 21:56 | 1 |
Try this test
4 4
!###
ABAA
AABA
*##$
The answer is 2 |
| Please check my answers on this tests..., are they right??? | Asyamov Igor | 1643. Attack of the Dark Fortress | 17 Aug 2020 20:01 | 12 |
1)
in:
3 5
..*..
!....
....$
out: 3
2)
in:
5 8
....AA.#
.######!
...BA*##
.#######
..B$...B
out: 3
3)
in:
5 8
....AA.#
.######!
....#*##
.#######
..B$...B
out: Impossible
4)
in:
1 3
$*!
out: Impossible
5)
in:
1 3
*!$
out: 2
I have used BFS, but still WA 22 :-(
Edited by author 26.10.2008 13:57
Edited by author 26.10.2008 14:04
Edited by author 26.10.2008 14:17 Now Accepted :-)
All my tests are correct!!!
Edited by author 26.10.2008 16:17 the army can stay in one point ?
so in this input
1 3
*!$
the corresponding output is 2 ? test 22 Sichov Evgeniy (ONPU) 26 Jan 2009 16:22 Can you lell what was wrong with your program? I`m having WA 22... Please give me some test i also used BFS, but have WA10. Your tests are passed on my computer. Could you give more tests? test 21 Vit Demidenko 2 Mar 2010 19:43 5 7
..!....
.......
.####.*
.......
..$....
Answer: 4
This test help me with wa21 This one helped me to deal with WA10.
1 3
!*$
Answer: Impossible Interesting problem. But only after few WA I understood problem statement correctly :) Re: test 22 Anton Chaplygin[Kungur,Perm kray] 14 Aug 2011 12:49 There is something wrong with limitations is the statement. I set maxN = 300 and got AC. WA 11 MOPDOBOPOT (USU) 5 Aug 2012 02:22 This test helped me to pass WA11:
3 5
.AAA!
.A*A.
$AAA.
output: 2
Another interesting test:
1 12
#AB$#A!B#B*#
output: 2
Edited by author 05.08.2012 02:31 Thanks! Thanks to your first test, I found out that I misunderstood the condition. |
| Hint if WA10 | Ефанов КН114 | 1643. Attack of the Dark Fortress | 17 Aug 2020 19:59 | 4 |
Try this test:
3 3
##$
#*#
!##
Answer: Impossible thank you！ I am trying deal with this problem |
| WA 45 | Velea Alex | 1643. Attack of the Dark Fortress | 3 Nov 2015 00:58 | 3 |
WA 45 Velea Alex 2 Sep 2010 17:18 hi, I used bf search and all the things seem to work correctly, but I get WA 45... I have no idea what is my mistake... help me, please :) give me some tests You must use dijkstra not bfs Petru Trimbitas is incorrect; you do not have to use Dijkstra. |
| wa19 | Roman | 1643. Attack of the Dark Fortress | 30 Jul 2015 20:02 | 5 |
wa19 Roman 28 Oct 2008 23:30 Re: wa19 Hanzbrow (TNU) KCC 12 Jul 2009 18:09 I had the same WA19. This test helped me figure out the issue
10 10
......#!#.
......##Z.
...Z......
...Z*.....
...ZKK....
......##..
.....K.##.
.....##$#.
......###.
..........
correct answer is 3, but my old code generated 4 my code gives 3, but I still got WA#19 Thank you very much! This test helped me when I had problems with test 11. |
| No subject | Fetisov Alex [Psych Up club] | 1643. Attack of the Dark Fortress | 13 Dec 2013 21:39 | 3 |
No subject Fetisov Alex [Psych Up club] 5 Dec 2012 05:22 Good tricky problem
Edited by author 05.12.2012 05:22 |
| Please explain the test case | shafaet | 1643. Attack of the Dark Fortress | 11 Dec 2013 22:26 | 3 |
How can gelu's army reach the castle in 11 days?? |
| WA 27? | jjohn | 1643. Attack of the Dark Fortress | 25 Sep 2013 13:25 | 1 |
WA 27? jjohn 25 Sep 2013 13:25 I think my program is correct, but i've gotten wa 27 three times.
Does anyone know what this test iss? |
| DFS is too slow for this problem | MOPDOBOPOT (USU) | 1643. Attack of the Dark Fortress | 23 Sep 2012 21:21 | 3 |
DFS - TL22 1.046s
BFS - Accepted 0.031s Using DFS for shortest path problem? Great job! DFS have so clean and short realisation that i can't think about BFS even if it is required! :D |
| Can you give me answer for one test? | Lebedev | 1643. Attack of the Dark Fortress | 8 Dec 2011 02:50 | 3 |
Which answer for test
2 2
#$
!*
Who have AC program, please help. Well, what is your answer?
By reading the text, I understand that the armies cannot attack the fortress alone. So I think the answer should be 2 (one for joining the armies, one for attacking the fortress). Of course, the answer is 2. First step for meeting the armies and the second one for attack. |
| About Teleports | Maxim Dvoynishnikov (Dnipropetrovsk SU) | 1643. Attack of the Dark Fortress | 1 Dec 2011 00:24 | 6 |
Is it true that the army must use teleport? Or it can ignore teleport? No comment =)
See the first sample - there is an answer to your question No! In samples no answer!
In the first sample Katherina's army needs 8 days to arrive to Fortress, if it can ignore teleport, and 11 days, if it must use teleport. Or 10 days (using both B-teleport).
At the same time Gelu's army arrives to Fortress using teleport at 11 days.
Hence in this sample Katherina's army can come by several ways. Oh, yes, now I see that you're right. It's an oversight of the author of the problem, of course. An army may not use teleports. * Maxim Dvoynishnikov (Dnipropetrovsk SU) 25 Oct 2008 23:47 Finally! My code was accepted.
For future solutions: the number of teleports may be more than two. Re: * IgorKoval(from Pskov) 1 Dec 2011 00:24 There may be also 1 teleport, 2 teleports, 3 teleports,..
Edited by author 01.12.2011 00:24 |
| WA30 | Borozdin Kirill | 1643. Attack of the Dark Fortress | 8 Feb 2011 16:20 | 1 |
WA30 Borozdin Kirill 8 Feb 2011 16:20 |
