| ENG RUS | Timus Online Judge |
Обсуждение задачи 1088. Илья МуромецArtem Khyzha WA#25 [1] // Задача 1088. Илья Муромец 17 авг 2010 02:19 If you're unlucky and get WA#25 (just like I did), try a test: > 2 4 5 1 1 1 The answer should be NO. This obvious test helped me to fix a little bug, so I decided to share. kvsmirnov Re: WA#25 // Задача 1088. Илья Муромец 12 июн 2022 18:26 Thank you! MOPDOBOPOT (USU) WA24 (hint) // Задача 1088. Илья Муромец 3 авг 2012 18:29 Don't forget cases when Ilya and Alesha are on same way (from root to berth). In my solution lca of positions could be less than they was :) For example: 4 4 4 1 2 0 output: YES 4 2 4 7 7 2 output: YES Edited by author 03.08.2012 18:32 tiancaihb Such a "BIG" problem! [1] // Задача 1088. Илья Муромец 22 июл 2009 15:01 When I saw its length, I nearly fainted! Too hard for us ESL to understand. But actually it's a very simple problem! ps:ESL=English as second language amaroq Re: Such a "BIG" problem! // Задача 1088. Илья Муромец 1 июн 2011 12:38 I think it's also hard to understand if your first language is English. This is a problem from a contest for children. Anyone who sets such a bad example for their children should be deeply ashamed of himself. boleyn.su HINT // Задача 1088. Илья Муромец 12 апр 2010 14:29 HINT: dec(Ep);dec(Dp); //for Pascal Ep--;Dp--; //for C/C++ AlainDelon What's the usage of parameter "F" [6] // Задача 1088. Илья Муромец 28 июн 2008 12:47 Hi, for the "F" parameter, I can see that it is the hight of the binary tree. But in my AC program, I didn't even use it. below is my program, anything I've missed? ====================== code deleted ============================== Edited by moderator 01.10.2022 12:26 Sandro (USU) Your program is wrong (+) [3] // Задача 1088. Илья Муромец 28 июн 2008 18:21 I added some new tests. Look, your code has got WA. :) Edited by author 29.06.2008 12:03 zx Re: You program is wrong (+) // Задача 1088. Илья Муромец 28 июн 2008 18:47 orz! AlainDelon Re: Your program is wrong (+) [1] // Задача 1088. Илья Муромец 29 июн 2008 19:14 Thank you. Now, I feel more realistic, but have to start researching again:) AlainDelon Re: Your program is wrong (+) // Задача 1088. Илья Муромец 29 июн 2008 22:38 Oops, I modified my program, I missed some cases in the original one. But still got AC without using F... Erop [USU] Re: What's the usage of parameter "F" [1] // Задача 1088. Илья Муромец 18 мар 2009 18:28 My AC program don't use F too. zbsGuy to admins!!! // Задача 1088. Илья Муромец 21 авг 2009 04:31 In autor's solution uses F or not??? Alex Tolstov (SPb SPU) Спасибо [3] // Задача 1088. Илья Муромец 17 авг 2009 23:17 Я раз 10 прочитал задачу, и до сих пор не понял, что от меня требуется((((( Автору зачОт)))) zbsGuy Re: Спасибо [2] // Задача 1088. Илья Муромец 18 авг 2009 00:06 +1 :))) Very bad statements and hard to understand :((( 2admin : Author's solution used all numbers or not? Sergey Lazarev (SPb AU) Re: Спасибо [1] // Задача 1088. Илья Муромец 18 авг 2009 12:09 You are to find distance between two nodes in tree. D and E - heights of these nodes; Ep and Dp - numbers of leaves which are nearest to these nodes (in this tree only leaves are numbered); F - height of the tree. zbsGuy Re: Спасибо // Задача 1088. Илья Муромец 21 авг 2009 04:27 Thanks I got AC, but statements is hard to understand :( Tural Neymanov Hint for all who have WA#18 // Задача 1088. Илья Муромец 6 фев 2008 09:52 Do not use set(for example: i in [k..l])! do like this: (i>=k) and (i<=l). Set can not contain elements more than byte. Edited by author 06.02.2008 09:53 s.r@ Superfluous entrance data [1] // Задача 1088. Илья Муромец 7 дек 2006 09:09 In a problem 1088 are excessive entrance data, to be exact it perfectly is solved without F. Aram Shatakhtsyan Re: Superfluous entrance data // Задача 1088. Илья Муромец 18 апр 2007 18:28 Yes, in Timus there are some problems, in which not all input data are useful. Kant SU of Russia: Roman Lipovsky Can somebody give me full explanation of this problem? [5] // Задача 1088. Илья Муромец 25 окт 2004 21:15 Can somebody give me full explanation of this problem? Thanks. Michael_Rybak I barely believe anyone can. Ask questions (-) [3] // Задача 1088. Илья Муромец 26 окт 2004 17:00 Kant SU of Russia: Roman Lipovsky Re: I barely believe anyone can. Ask questions (-) [2] // Задача 1088. Илья Муромец 26 окт 2004 17:09 Full binary tree. Ilya is on the deep D, magis stone is on deep E. But what mean numbers Dp and Ep? Michael_Rybak Ep specifies one of the leafs, which are in Ilya's subtree. Dp specifies one of the leafs, which are in the magis stone's subtree (+) [1] // Задача 1088. Илья Муромец 26 окт 2004 18:32 You know the deepness of each by D and E, but this isn't enough to know, which exactly nodes are considered. So, in this problem the nodes are specified by 2 parameters: deepness, and a number of some leaf of it's subtree. Obviously, there can be many different pairs describing the same node. In this problem, only leafs are enumerated (see problem statement). Edited by author 26.10.2004 18:35 Edited by author 26.10.2004 19:32 Kant SU of Russia: Roman Lipovsky Re: Ep specifies one of the leafs, which are in Ilya's subtree. Dp specifies one of the leafs, which are in the magis stone's subtree (+) // Задача 1088. Илья Муромец 26 окт 2004 19:26 Thanks a lot! Shahriar Nirjon Re: Can somebody give me full explanation of this problem? // Задача 1088. Илья Муромец 24 июн 2005 02:15 Full Binary Tree with depth: F Stone is at depth: F-D from root and a tree rooted at the stone holds leaf #Dp Ilya is at depth: F-E from root and a tree rooted at the Ilya's position holds leaf #Ep find whether the distance of the two nodes is <= H Dinh Hong Minh Can u explain me this problem , DQH ( DSAP Group ) ? [5] // Задача 1088. Илья Муромец 13 мар 2001 21:07 Dinh Quang Hiep (mg9h@yahoo.com) hmmmm, u are so lazy X-( [4] // Задача 1088. Илья Муромец 13 мар 2001 21:14 it's a full binary tree, with the deep = F Ilya is on the deep of D The magic stone is in the deep of E every leaves is numbered from the left, the fist number is 1. do u understand what i've said :">???? QH@ Dinh Hong Minh What does this problem want ? [2] // Задача 1088. Илья Муромец 13 мар 2001 21:51 > it's a full binary tree, with the deep = F > Ilya is on the deep of D > The magic stone is in the deep of E > every leaves is numbered from the left, the fist number is > 1. > do u understand what i've said :">???? > > QH@ > Dinh Quang Hiep (mg9h@yahoo.com) Re: What does this problem want ? // Задача 1088. Илья Муромец 13 мар 2001 21:53 u must count the length from Ilya to the magic stone, and if this length <= H, u write YES, otherwise, u write NO !!!! Dinh Hong Minh Thanks // Задача 1088. Илья Муромец 13 мар 2001 21:55 > > it's a full binary tree, with the deep = F > > Ilya is on the deep of D > > The magic stone is in the deep of E > > every leaves is numbered from the left, the fist number > is > > 1. > > do u understand what i've said :">???? > > > > QH@ > > Cain Who can help me?What do "Dp" and "Ep" mean? // Задача 1088. Илья Муромец 9 июн 2001 18:47
|