Discussion @ 1555. Find the Treasure! @ Timus Online Judge

Show all threads Hide all threads Show all messages Hide all messages
some tests	LeTim	1555. Find the Treasure!	2 Apr 2025 17:41	1
some tests LeTim 2 Apr 2025 17:41 Input: 2 .-.... \|1\|... ...... ....-. \|..2\| .-..-. Output: Draw Input: 5 ............... .1\|\|....\|\|..... ............... ............... ..\|\|..\|.\|\|.\|\|.. ............... ............... ..\|\|.\|\|.\|\|.\|\|.. ............... ............... ..\|\|.\|\|\|..\|\|.. ............... ............... .....\|\|....\|\|2. ............... Output: Win 33 M2 Input: 5 ............... .1\|\|....\|\|..... ............... ............... ..\|\|..\|.\|\|.\|\|.. ............... ............... ..\|\|.\|\|.\|\|.\|\|.. ............... ............... ..\|\|.\|\|.\|..\|\|.. ............... ............... .....\|\|...\|\|2. ............... Output: Draw Input: 6 .-..-..-..-..-..-. \|1...............\| .................. .................. \|................\| .................. .................. \|...............\| .................. .................. \|................\| .................. .................. \|................\| .................. .................. \|...............2\| .-..-..-..-..-..-. Output: Win 15 M2 (or Win 15 M6, does not matter) Input: 6 .-..-..-..-..-..-. \|1...............\| .................. .................. \|................\| .................. .................. \|...............\| .................. .................. \|................\| .................. .................. \|................\| .................. .................. \|...............2\| .-..-..-..-..-..-. Output: Draw Input: 6 .-..-.....-..-..-. \|1...............\| .................. .................. \|................\| .................. .......-.......... ......\|.........\| .................. .................. \|................\| .................. .................. \|................\| .................. .................. \|...............2\| .-..-..-..-..-..-. Output: Lose 1 S5 Edited by author 02.04.2025 17:51
all 12534 difficulty is reading comprehension	Shen Yang	1555. Find the Treasure!	16 Oct 2016 11:23	1
all 12534 difficulty is reading comprehension Shen Yang 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
Why first sample is 5	Shen Yang	1555. Find the Treasure!	15 Oct 2016 11:19	1
Why first sample is 5 Shen Yang 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?
How to calculate remoteness function for loopy games?	Radi Muhammad Reza	1555. Find the Treasure!	30 Jul 2012 07:19	1
How to calculate remoteness function for loopy games? Radi Muhammad Reza 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.
When can the result be 'Draw' ?	Radi Muhammad Reza	1555. Find the Treasure!	29 Jul 2012 00:18	4
When can the result be 'Draw' ? Radi Muhammad Reza 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. Re: When can the result be 'Draw' ? Neofit* 28 Jul 2012 08:31 if (state[IND(start)] == 'N') printf("Draw\n"); Re: When can the result be 'Draw' ? Radi Muhammad Reza 28 Jul 2012 13:38 Sorry, didn't understand you :( Can you give a bit more detail? Re: When can the result be 'Draw' ? Erop [USU] 29 Jul 2012 00:18 they will infinitely pass moves, so answer is Draw
If both player can take the chest, the problem may be more interesting	Lin	1555. Find the Treasure!	7 Sep 2011 09:44	1
If both player can take the chest, the problem may be more interesting Lin 7 Sep 2011 09:44 6 .............-.... ............\|2\|\|.. ..........-....... ..........-...... ........\|\|*...\|\|.. .................. .................. ........\|\|1...\|\|.. .................. .................. \|.......\|\|....\|\|.. .................. .................. \|....\|.. .....\|\|.. .......-..-..-.... .............-.... ........ ..\|...... .......-..-.......
Problem is very simple...(I think)	alexutz_mircescu	1555. Find the Treasure!	22 Jul 2008 16:55	3
Problem is very simple...(I think) alexutz_mircescu 18 Oct 2007 19:24 do you want an idea? :) tell me Re: Problem is very simple...(I think) Denis Koshman 14 Jul 2008 21:58 I have counted ~3.5M states, is it? :) Edited by author 14.07.2008 22:00 Re: Problem is very simple...(I think) LX&R Bacherikov [KNU] 22 Jul 2008 16:55 There are even < 2 000 000 positions. The idea is really simple, but it's long to code...
Please explaine the sample.	caoqinxiang	1555. Find the Treasure!	11 Jul 2008 14:40	2
Please explaine the sample. caoqinxiang 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. Re: Please explaine the sample. LX&R Bacherikov [KNU] 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.

Style: flat | tree | nested
Thread Order: bubble | fixed

Discussion of Problem 1555. Find the Treasure!