| ENG RUS | Timus Online Judge |
Discussion of Problem 1555. Find the Treasure!Shen Yang all 12534 difficulty is reading comprehension // Problem 1555. Find the Treasure! 16 Oct 2016 11:23 I don't think problem statement is clear.. and obviously algorithm difficult is far not worth than 10000+ reading comprehension is possible Edited by author 16.10.2016 11:24 Don't use scanf !!!!!! Edited by author 16.10.2016 18:23 Shen Yang Why first sample is 5 // Problem 1555. Find the Treasure! 15 Oct 2016 11:19 I think it takes first player 5 turns to get '*', and 3 turns to move outside,it is at least 8 turns. why is 5 turns? Radi Muhammad Reza How to calculate remoteness function for loopy games? // Problem 1555. Find the Treasure! 30 Jul 2012 07:19 I think, this problem requires that; right? Any method description or link to article is really appreciable Thanks in advance. Radi Muhammad Reza When can the result be 'Draw' ? [3] // Problem 1555. Find the Treasure! 28 Jul 2012 00:38 if both players get stuck and after shooting their rockets still stuck? or is infinite game scenario like 'stalemate' is possible? like 2 ...... .*..2. ...... ...... .1.... ...... Here, if 1 makes turn 2 wins by killing; same goes for 2. now, would they infinitely 'pass moves' to lead it to a 'Draw' / stalemate? or the ans is 'Lose'? Please, help me understand the problem? Thanks in Advance. Neofit Re: When can the result be 'Draw' ? [1] // Problem 1555. Find the Treasure! 28 Jul 2012 08:31 if (state[IND(start)] == 'N') printf("Draw\n"); Radi Muhammad Reza Re: When can the result be 'Draw' ? // Problem 1555. Find the Treasure! 28 Jul 2012 13:38 Sorry, didn't understand you :( Can you give a bit more detail? Erop [USU] Re: When can the result be 'Draw' ? // Problem 1555. Find the Treasure! 29 Jul 2012 00:18 they will infinitely pass moves, so answer is Draw Lin If both player can take the chest, the problem may be more interesting // Problem 1555. Find the Treasure! 7 Sep 2011 09:44 6 .............-.... ............|2||.. ..........-....... ..........-...... ........||*...||.. .................. .................. ........||1...||.. .................. .................. |.......||....||.. .................. .................. |....|.. .....||.. .......-..-..-.... .............-.... ........ ..|...... .......-..-....... alexutz_mircescu Problem is very simple...(I think) [2] // Problem 1555. Find the Treasure! 18 Oct 2007 19:24 do you want an idea? :) tell me Denis Koshman Re: Problem is very simple...(I think) // Problem 1555. Find the Treasure! 14 Jul 2008 21:58 I have counted ~3.5M states, is it? :) Edited by author 14.07.2008 22:00 LX&R Bacherikov [KNU] Re: Problem is very simple...(I think) // Problem 1555. Find the Treasure! 22 Jul 2008 16:55 There are even < 2 000 000 positions. The idea is really simple, but it's long to code... caoqinxiang Please explaine the sample. [1] // Problem 1555. Find the Treasure! 11 Jan 2008 08:17 I cannot understand why the answer is win 5 and lose 1.I think it should be win 3 and lose 3. LX&R Bacherikov [KNU] Re: Please explaine the sample. // Problem 1555. Find the Treasure! 11 Jul 2008 14:40 Sample 1: we count turns of both players. Sample 2: the first player can't win and he wants to minimize the number of turns. So he makes suicide.
|