| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| WA#25 | Artem Khyzha | 1088. Илья Муромец | 12 июн 2022 18:26 | 2 |
WA#25 Artem Khyzha 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. |
| WA24 (hint) | MOPDOBOPOT (USU) | 1088. Илья Муромец | 3 авг 2012 18:29 | 1 |
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 |
| Such a "BIG" problem! | tiancaihb | 1088. Илья Муромец | 1 июн 2011 12:38 | 2 |
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 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. |
| HINT | boleyn.su | 1088. Илья Муромец | 12 апр 2010 14:29 | 1 |
HINT boleyn.su 12 апр 2010 14:29 HINT: dec(Ep);dec(Dp); //for Pascal
Ep--;Dp--; //for C/C++ |
| What's the usage of parameter "F" | AlainDelon | 1088. Илья Муромец | 21 авг 2009 04:31 | 7 |
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 I added some new tests. Look, your code has got WA. :)
Edited by author 29.06.2008 12:03 Thank you.
Now, I feel more realistic, but have to start researching again:) Oops, I modified my program, I missed some cases in the original one. But still got AC without using F... My AC program don't use F too. In autor's solution uses F or not??? |
| Спасибо | Alex Tolstov (SPb SPU) | 1088. Илья Муромец | 21 авг 2009 04:27 | 4 |
Спасибо Alex Tolstov (SPb SPU) 17 авг 2009 23:17 Я раз 10 прочитал задачу, и до сих пор не понял, что от меня требуется(((((
Автору зачОт)))) +1 :))) Very bad statements and hard to understand :(((
2admin : Author's solution used all numbers or not? 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. Thanks I got AC, but statements is hard to understand :( |
| Hint for all who have WA#18 | Tural Neymanov | 1088. Илья Муромец | 6 фев 2008 09:52 | 1 |
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 |
| Superfluous entrance data | s.r@ | 1088. Илья Муромец | 18 апр 2007 18:28 | 2 |
In a problem 1088 are excessive entrance data, to be exact it perfectly is solved without F. Yes, in Timus there are some problems, in which not
all input data are useful. |
| Can somebody give me full explanation of this problem? | Kant SU of Russia: Roman Lipovsky | 1088. Илья Муромец | 24 июн 2005 02:15 | 6 |
Can somebody give me full explanation of this problem?
Thanks. Full binary tree.
Ilya is on the deep D, magis stone is on deep E.
But what mean numbers Dp and Ep? 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 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 |
| Can u explain me this problem , DQH ( DSAP Group ) ? | Dinh Hong Minh | 1088. Илья Муромец | 9 июн 2001 18:47 | 6 |
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@ > 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@
> u must count the length from Ilya to the magic stone, and if
this length <= H, u write YES, otherwise, u write NO !!!! Thanks Dinh Hong Minh 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@
> > |
